Base | Representation |
---|---|
bin | 1100000000011010100… |
… | …11001101101111010011 |
3 | 1110102211121210102210000 |
4 | 12000031103031233103 |
5 | 23224340220014420 |
6 | 513303535541043 |
7 | 41543061103245 |
oct | 6001523155723 |
9 | 1412747712700 |
10 | 412540001235 |
11 | 149a5909198a |
12 | 67b5298a783 |
13 | 2cb9662220b |
14 | 15d777ca095 |
15 | aae7784690 |
hex | 600d4cdbd3 |
412540001235 has 20 divisors (see below), whose sum is σ = 739516151088. Its totient is φ = 220021333776.
The previous prime is 412540001221. The next prime is 412540001273. The reversal of 412540001235 is 532100045214.
412540001235 is a `hidden beast` number, since 4 + 1 + 25 + 400 + 0 + 1 + 235 = 666.
It is not a de Polignac number, because 412540001235 - 24 = 412540001219 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 412540001199 and 412540001208.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 509308239 + ... + 509309048.
Almost surely, 2412540001235 is an apocalyptic number.
412540001235 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
412540001235 is a deficient number, since it is larger than the sum of its proper divisors (326976149853).
412540001235 is a wasteful number, since it uses less digits than its factorization.
412540001235 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1018617304 (or 1018617295 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
Adding to 412540001235 its reverse (532100045214), we get a palindrome (944640046449).
The spelling of 412540001235 in words is "four hundred twelve billion, five hundred forty million, one thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •