Base | Representation |
---|---|
bin | 10110111101111001000101… |
… | …001101011010011001001011 |
3 | 111020122110222122121211011211 |
4 | 112331321011031122121023 |
5 | 101214422343203324321 |
6 | 554455240213433551 |
7 | 30163513653435223 |
oct | 2675710515323113 |
9 | 436573878554154 |
10 | 101010202011211 |
11 | 2a204205783099 |
12 | b3b455433b8b7 |
13 | 44492b4c0b7bc |
14 | 1ad2cc4165083 |
15 | ba27919e90e1 |
hex | 5bde4535a64b |
101010202011211 has 4 divisors (see below), whose sum is σ = 103359276476632. Its totient is φ = 98661127545792.
The previous prime is 101010202011193. The next prime is 101010202011247. The reversal of 101010202011211 is 112110202010101.
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 101010202011211 - 29 = 101010202010699 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101010202011191 and 101010202011200.
It is not an unprimeable number, because it can be changed into a prime (101010202611211) 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, 1174537232646 + ... + 1174537232731.
It is an arithmetic number, because the mean of its divisors is an integer number (25839819119158).
Almost surely, 2101010202011211 is an apocalyptic number.
101010202011211 is a deficient number, since it is larger than the sum of its proper divisors (2349074465421).
101010202011211 is an equidigital number, since it uses as much as digits as its factorization.
101010202011211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2349074465420.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101010202011211 its reverse (112110202010101), we get a palindrome (213120404021312).
The spelling of 101010202011211 in words is "one hundred one trillion, ten billion, two hundred two million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •