Base | Representation |
---|---|
bin | 10110111110000011001001… |
… | …100010101101000111001011 |
3 | 111020200111220000202020122211 |
4 | 112332003021202231013023 |
5 | 101220112013100320021 |
6 | 554504225015525551 |
7 | 30164345566025344 |
oct | 2676031142550713 |
9 | 436614800666584 |
10 | 101021012120011 |
11 | 2a208852802905 |
12 | b3b66706898b7 |
13 | 444a3186ab099 |
14 | 1ad362bb250cb |
15 | ba2bc5a793e1 |
hex | 5be0c98ad1cb |
101021012120011 has 8 divisors (see below), whose sum is σ = 102053497684320. Its totient is φ = 99989520768192.
The previous prime is 101021012119997. The next prime is 101021012120023. The reversal of 101021012120011 is 110021210120101.
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 101021012120011 - 215 = 101021012087243 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101021012119973 and 101021012120000.
It is not an unprimeable number, because it can be changed into a prime (101021012121011) 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, 248348866 + ... + 248755303.
It is an arithmetic number, because the mean of its divisors is an integer number (12756687210540).
Almost surely, 2101021012120011 is an apocalyptic number.
101021012120011 is a deficient number, since it is larger than the sum of its proper divisors (1032485564309).
101021012120011 is a wasteful number, since it uses less digits than its factorization.
101021012120011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 497106245.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101021012120011 its reverse (110021210120101), we get a palindrome (211042222240112).
The spelling of 101021012120011 in words is "one hundred one trillion, twenty-one billion, twelve million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •