Base | Representation |
---|---|
bin | 1010011001010101001110… |
… | …1100010110011111010000 |
3 | 1111110201122002210210011011 |
4 | 2212111103230112133100 |
5 | 2444233234400010112 |
6 | 40151002441300304 |
7 | 2256545534601064 |
oct | 246252354263720 |
9 | 44421562723134 |
10 | 11430312110032 |
11 | 3707628220212 |
12 | 1347330494694 |
13 | 64bb489a537a |
14 | 2b73313c9aa4 |
15 | 14c4de2cdaa7 |
hex | a6553b167d0 |
11430312110032 has 10 divisors (see below), whose sum is σ = 22146229713218. Its totient is φ = 5715156055008.
The previous prime is 11430312110017. The next prime is 11430312110033. The reversal of 11430312110032 is 23001121303411.
11430312110032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 8476506165136 + 2953805944896 = 2911444^2 + 1718664^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11430312109985 and 11430312110012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11430312110033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 357197253423 + ... + 357197253454.
Almost surely, 211430312110032 is an apocalyptic number.
It is an amenable number.
11430312110032 is a deficient number, since it is larger than the sum of its proper divisors (10715917603186).
11430312110032 is an equidigital number, since it uses as much as digits as its factorization.
11430312110032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 714394506885 (or 714394506879 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 11430312110032 its reverse (23001121303411), we get a palindrome (34431433413443).
The spelling of 11430312110032 in words is "eleven trillion, four hundred thirty billion, three hundred twelve million, one hundred ten thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •