Base | Representation |
---|---|
bin | 1001001101100010100001… |
… | …1111000000101111011111 |
3 | 1022212020200111220212121212 |
4 | 2103120220133000233133 |
5 | 2311420034244231421 |
6 | 33312500355215035 |
7 | 2063511352260335 |
oct | 223305037005737 |
9 | 38766614825555 |
10 | 10128212102111 |
11 | 3255394764a94 |
12 | 1176ab98a747b |
13 | 5861177b95bc |
14 | 2702cad91b55 |
15 | 1286d0d3de5b |
hex | 936287c0bdf |
10128212102111 has 4 divisors (see below), whose sum is σ = 10343705976672. Its totient is φ = 9912718227552.
The previous prime is 10128212102087. The next prime is 10128212102161. The reversal of 10128212102111 is 11120121282101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10128212102111 - 214 = 10128212085727 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10128212102161) by changing a digit.
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, 107746937210 + ... + 107746937303.
It is an arithmetic number, because the mean of its divisors is an integer number (2585926494168).
Almost surely, 210128212102111 is an apocalyptic number.
10128212102111 is a deficient number, since it is larger than the sum of its proper divisors (215493874561).
10128212102111 is an equidigital number, since it uses as much as digits as its factorization.
10128212102111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215493874560.
The product of its (nonzero) digits is 128, while the sum is 23.
Adding to 10128212102111 its reverse (11120121282101), we get a palindrome (21248333384212).
The spelling of 10128212102111 in words is "ten trillion, one hundred twenty-eight billion, two hundred twelve million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •