Base | Representation |
---|---|
bin | 10111000000110011010001… |
… | …010000000110011111111011 |
3 | 111021100121000021122000122012 |
4 | 113000303101100012133323 |
5 | 101231211311211201021 |
6 | 555131142014320135 |
7 | 30214122060462530 |
oct | 2700632120063773 |
9 | 437317007560565 |
10 | 101210120022011 |
11 | 2a280a75234620 |
12 | b4272484b904b |
13 | 44620c5252050 |
14 | 1adc84b3c2d87 |
15 | ba7a92b7535b |
hex | 5c0cd14067fb |
101210120022011 has 64 divisors (see below), whose sum is σ = 150139899979776. Its totient is φ = 65537257420800.
The previous prime is 101210120021993. The next prime is 101210120022041. The reversal of 101210120022011 is 110220021012101.
It is not a de Polignac number, because 101210120022011 - 214 = 101210120005627 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101210120022041) 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 63 ways as a sum of consecutive naturals, for example, 128904020 + ... + 129686801.
It is an arithmetic number, because the mean of its divisors is an integer number (2345935937184).
Almost surely, 2101210120022011 is an apocalyptic number.
101210120022011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101210120022011 is a deficient number, since it is larger than the sum of its proper divisors (48929779957765).
101210120022011 is a wasteful number, since it uses less digits than its factorization.
101210120022011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 258590892.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101210120022011 its reverse (110220021012101), we get a palindrome (211430141034112).
The spelling of 101210120022011 in words is "one hundred one trillion, two hundred ten billion, one hundred twenty million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •