Base | Representation |
---|---|
bin | 1001010111110111100000… |
… | …1100110001001110110100 |
3 | 1100111012122222202022212020 |
4 | 2111331320030301032310 |
5 | 2322321424122001104 |
6 | 33530202550353140 |
7 | 2112362305325661 |
oct | 225757014611664 |
9 | 40435588668766 |
10 | 10305643156404 |
11 | 3313664992242 |
12 | 11a537705b7b0 |
13 | 599a83141a1b |
14 | 278b1d910a68 |
15 | 12d117c4d2d9 |
hex | 95f783313b4 |
10305643156404 has 12 divisors (see below), whose sum is σ = 24046500698304. Its totient is φ = 3435214385464.
The previous prime is 10305643156357. The next prime is 10305643156427. The reversal of 10305643156404 is 40465134650301.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×103056431564042 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 429401798172 + ... + 429401798195.
It is an arithmetic number, because the mean of its divisors is an integer number (2003875058192).
Almost surely, 210305643156404 is an apocalyptic number.
It is an amenable number.
10305643156404 is an abundant number, since it is smaller than the sum of its proper divisors (13740857541900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10305643156404 is a wasteful number, since it uses less digits than its factorization.
10305643156404 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 858803596374 (or 858803596372 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 42.
The spelling of 10305643156404 in words is "ten trillion, three hundred five billion, six hundred forty-three million, one hundred fifty-six thousand, four hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •