Base | Representation |
---|---|
bin | 1001000110000110000100… |
… | …0011011001011001111110 |
3 | 1022102000112221120220000002 |
4 | 2101201201003121121332 |
5 | 2302321114402124114 |
6 | 33134025135234302 |
7 | 2051333025500504 |
oct | 221414103313176 |
9 | 38360487526002 |
10 | 10000312145534 |
11 | 3206121553637 |
12 | 1156164378992 |
13 | 577043a19619 |
14 | 268036784674 |
15 | 1251e75507de |
hex | 918610d967e |
10000312145534 has 48 divisors (see below), whose sum is σ = 16655019217200. Its totient is φ = 4496125511808.
The previous prime is 10000312145533. The next prime is 10000312145609. The reversal of 10000312145534 is 43554121300001.
It is a super-2 number, since 2×100003121455342 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10000312145497 and 10000312145506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10000312145533) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2812247 + ... + 5282930.
It is an arithmetic number, because the mean of its divisors is an integer number (346979567025).
Almost surely, 210000312145534 is an apocalyptic number.
10000312145534 is a deficient number, since it is larger than the sum of its proper divisors (6654707071666).
10000312145534 is a wasteful number, since it uses less digits than its factorization.
10000312145534 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8095305 (or 8095286 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 29.
Adding to 10000312145534 its reverse (43554121300001), we get a palindrome (53554433445535).
The spelling of 10000312145534 in words is "ten trillion, three hundred twelve million, one hundred forty-five thousand, five hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •