Base | Representation |
---|---|
bin | 10111000000110011010001… |
… | …010111101001101001110011 |
3 | 111021100121000102100120022111 |
4 | 113000303101113221221303 |
5 | 101231211312213013021 |
6 | 555131142124550151 |
7 | 30214122113344312 |
oct | 2700632127515163 |
9 | 437317012316274 |
10 | 101210122001011 |
11 | 2a280a76366461 |
12 | b4272490b2357 |
13 | 44620c5795a5a |
14 | 1adc84b77a279 |
15 | ba7a92e168e1 |
hex | 5c0cd15e9a73 |
101210122001011 has 4 divisors (see below), whose sum is σ = 106536970527400. Its totient is φ = 95883273474624.
The previous prime is 101210122000991. The next prime is 101210122001033. The reversal of 101210122001011 is 110100221012101.
It is a happy number.
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 101210122001011 - 245 = 66025749912179 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101210122000982 and 101210122001000.
It is not an unprimeable number, because it can be changed into a prime (101210122004011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2663424263166 + ... + 2663424263203.
It is an arithmetic number, because the mean of its divisors is an integer number (26634242631850).
Almost surely, 2101210122001011 is an apocalyptic number.
101210122001011 is a deficient number, since it is larger than the sum of its proper divisors (5326848526389).
101210122001011 is an equidigital number, since it uses as much as digits as its factorization.
101210122001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5326848526388.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101210122001011 its reverse (110100221012101), we get a palindrome (211310343013112).
The spelling of 101210122001011 in words is "one hundred one trillion, two hundred ten billion, one hundred twenty-two million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •