Base | Representation |
---|---|
bin | 1001011111001010111011… |
… | …1000100011110110000000 |
3 | 1100221012112022111222100112 |
4 | 2113302232320203312000 |
5 | 2331400410323012102 |
6 | 34103553220210452 |
7 | 2124423513434420 |
oct | 227625670436600 |
9 | 40835468458315 |
10 | 10431114657152 |
11 | 33618a1315902 |
12 | 1205753239a28 |
13 | 5a885aa71ba7 |
14 | 280c237b2480 |
15 | 13150d244252 |
hex | 97caee23d80 |
10431114657152 has 64 divisors (see below), whose sum is σ = 24781996051200. Its totient is φ = 4276109105664.
The previous prime is 10431114657053. The next prime is 10431114657193. The reversal of 10431114657152 is 25175641113401.
10431114657152 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×104311146571522 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 253063502 + ... + 253104717.
It is an arithmetic number, because the mean of its divisors is an integer number (387218688300).
Almost surely, 210431114657152 is an apocalyptic number.
It is an amenable number.
10431114657152 is an abundant number, since it is smaller than the sum of its proper divisors (14350881394048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10431114657152 is an equidigital number, since it uses as much as digits as its factorization.
10431114657152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 506168263 (or 506168251 counting only the distinct ones).
The product of its (nonzero) digits is 100800, while the sum is 41.
The spelling of 10431114657152 in words is "ten trillion, four hundred thirty-one billion, one hundred fourteen million, six hundred fifty-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.387 sec. • engine limits •