Base | Representation |
---|---|
bin | 1001001101101110000010… |
… | …1011001110010011000111 |
3 | 1022212112122212200202110001 |
4 | 2103123200223032103013 |
5 | 2311442401342423421 |
6 | 33314131145142131 |
7 | 2063651054516122 |
oct | 223334053162307 |
9 | 38775585622401 |
10 | 10131302311111 |
11 | 3256730039823 |
12 | 117762078a947 |
13 | 5864baa96c37 |
14 | 27050155b3b9 |
15 | 1288122a1691 |
hex | 936e0ace4c7 |
10131302311111 has 8 divisors (see below), whose sum is σ = 10208716843248. Its totient is φ = 10053888936000.
The previous prime is 10131302311069. The next prime is 10131302311129. The reversal of 10131302311111 is 11111320313101.
10131302311111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10131302311111 - 221 = 10131300213959 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10131302311811) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27307531 + ... + 27676051.
It is an arithmetic number, because the mean of its divisors is an integer number (1276089605406).
Almost surely, 210131302311111 is an apocalyptic number.
10131302311111 is a deficient number, since it is larger than the sum of its proper divisors (77414532137).
10131302311111 is a wasteful number, since it uses less digits than its factorization.
10131302311111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 578513.
The product of its (nonzero) digits is 54, while the sum is 19.
Adding to 10131302311111 its reverse (11111320313101), we get a palindrome (21242622624212).
The spelling of 10131302311111 in words is "ten trillion, one hundred thirty-one billion, three hundred two million, three hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •