Base | Representation |
---|---|
bin | 10010110110100001… |
… | …00101111110101000 |
3 | 222010100110122011102 |
4 | 21123100211332220 |
5 | 131211434323422 |
6 | 4352144220532 |
7 | 505544114012 |
oct | 113320457650 |
9 | 28110418142 |
10 | 10121011112 |
11 | 43240574a3 |
12 | 1b6560a748 |
13 | c53aa9694 |
14 | 6c02631b2 |
15 | 3e3813192 |
hex | 25b425fa8 |
10121011112 has 8 divisors (see below), whose sum is σ = 18976895850. Its totient is φ = 5060505552.
The previous prime is 10121011111. The next prime is 10121011157. The reversal of 10121011112 is 21111012101.
10121011112 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., 6153774916 + 3967236196 = 78446^2 + 62986^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a junction number, because it is equal to n+sod(n) for n = 10121011093 and 10121011102.
It is not an unprimeable number, because it can be changed into a prime (10121011111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 632563187 + ... + 632563202.
Almost surely, 210121011112 is an apocalyptic number.
It is an amenable number.
10121011112 is a deficient number, since it is larger than the sum of its proper divisors (8855884738).
10121011112 is a wasteful number, since it uses less digits than its factorization.
10121011112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1265126395 (or 1265126391 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10121011112 its reverse (21111012101), we get a palindrome (31232023213).
The spelling of 10121011112 in words is "ten billion, one hundred twenty-one million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •