Base | Representation |
---|---|
bin | 10110111101110001100010… |
… | …011011001010010011101011 |
3 | 111020121201002011102210111011 |
4 | 112331301202123022103223 |
5 | 101214304301132020021 |
6 | 554451420351044351 |
7 | 30163106151362506 |
oct | 2675614233122353 |
9 | 436551064383434 |
10 | 101002102220011 |
11 | 2a200829647083 |
12 | b3b2a738106b7 |
13 | 44485c3ac8c45 |
14 | 1ad275652213d |
15 | ba246a88ade1 |
hex | 5bdc626ca4eb |
101002102220011 has 8 divisors (see below), whose sum is σ = 102943447655904. Its totient is φ = 99062076984000.
The previous prime is 101002102219961. The next prime is 101002102220051. The reversal of 101002102220011 is 110022201200101.
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 101002102220011 - 211 = 101002102217963 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101002102219973 and 101002102220000.
It is not an unprimeable number, because it can be changed into a prime (101002102220051) 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, 329895490 + ... + 330201511.
It is an arithmetic number, because the mean of its divisors is an integer number (12867930956988).
Almost surely, 2101002102220011 is an apocalyptic number.
101002102220011 is a deficient number, since it is larger than the sum of its proper divisors (1941345435893).
101002102220011 is an equidigital number, since it uses as much as digits as its factorization.
101002102220011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 660099941.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101002102220011 its reverse (110022201200101), we get a palindrome (211024303420112).
The spelling of 101002102220011 in words is "one hundred one trillion, two billion, one hundred two million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •