Base | Representation |
---|---|
bin | 10111000000110011001010… |
… | …110100011111001111001011 |
3 | 111021100120201202121000220211 |
4 | 113000303022310133033023 |
5 | 101231211101100320021 |
6 | 555131123201501551 |
7 | 30214116310356454 |
oct | 2700631264371713 |
9 | 437316652530824 |
10 | 101210012120011 |
11 | 2a280a1a336213 |
12 | b4272183418b7 |
13 | 44620a8aa2902 |
14 | 1adc83ad3612b |
15 | ba7a8845e3e1 |
hex | 5c0ccad1f3cb |
101210012120011 has 8 divisors (see below), whose sum is σ = 101529728300880. Its totient is φ = 100890298717728.
The previous prime is 101210012120003. The next prime is 101210012120081. The reversal of 101210012120011 is 110021210012101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101210012120011 - 23 = 101210012120003 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101210012119973 and 101210012120000.
It is not an unprimeable number, because it can be changed into a prime (101210012120081) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 91604985 + ... + 92703253.
It is an arithmetic number, because the mean of its divisors is an integer number (12691216037610).
Almost surely, 2101210012120011 is an apocalyptic number.
101210012120011 is a deficient number, since it is larger than the sum of its proper divisors (319716180869).
101210012120011 is a wasteful number, since it uses less digits than its factorization.
101210012120011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1389293.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101210012120011 its reverse (110021210012101), we get a palindrome (211231222132112).
The spelling of 101210012120011 in words is "one hundred one trillion, two hundred ten billion, twelve million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •