Base | Representation |
---|---|
bin | 1001001101001011110011… |
… | …1001000011010111111011 |
3 | 1022211122221101112200212021 |
4 | 2103102330321003113323 |
5 | 2311320041134201021 |
6 | 33310011205255311 |
7 | 2063204241404263 |
oct | 223227471032773 |
9 | 38748841480767 |
10 | 10122112022011 |
11 | 3252844398580 |
12 | 1175896a04537 |
13 | 585684a7c752 |
14 | 26dcacb707a3 |
15 | 128475537c41 |
hex | 934bce435fb |
10122112022011 has 16 divisors (see below), whose sum is σ = 11199495142368. Its totient is φ = 9071709472000.
The previous prime is 10122112021999. The next prime is 10122112022027. The reversal of 10122112022011 is 11022021122101.
It is a cyclic number.
It is not a de Polignac number, because 10122112022011 - 231 = 10119964538363 is a prime.
It is a super-2 number, since 2×101221120220112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10122112022051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19292236 + ... + 19809961.
It is an arithmetic number, because the mean of its divisors is an integer number (699968446398).
Almost surely, 210122112022011 is an apocalyptic number.
10122112022011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10122112022011 is a deficient number, since it is larger than the sum of its proper divisors (1077383120357).
10122112022011 is a wasteful number, since it uses less digits than its factorization.
10122112022011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39102542.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 10122112022011 its reverse (11022021122101), we get a palindrome (21144133144112).
The spelling of 10122112022011 in words is "ten trillion, one hundred twenty-two billion, one hundred twelve million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •