Base | Representation |
---|---|
bin | 10110111101110001100010… |
… | …011011001010010101010001 |
3 | 111020121201002011102210121221 |
4 | 112331301202123022111101 |
5 | 101214304301132020423 |
6 | 554451420351045041 |
7 | 30163106151363013 |
oct | 2675614233122521 |
9 | 436551064383557 |
10 | 101002102220113 |
11 | 2a200829647166 |
12 | b3b2a73810781 |
13 | 44485c3ac8cc3 |
14 | 1ad27565221b3 |
15 | ba246a88ae5d |
hex | 5bdc626ca551 |
101002102220113 has 4 divisors (see below), whose sum is σ = 101209498734400. Its totient is φ = 100794705705828.
The previous prime is 101002102220101. The next prime is 101002102220137. The reversal of 101002102220113 is 311022201200101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101002102220113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101002102220413) 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, 103698256413 + ... + 103698257386.
It is an arithmetic number, because the mean of its divisors is an integer number (25302374683600).
Almost surely, 2101002102220113 is an apocalyptic number.
It is an amenable number.
101002102220113 is a deficient number, since it is larger than the sum of its proper divisors (207396514287).
101002102220113 is an equidigital number, since it uses as much as digits as its factorization.
101002102220113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 207396514286.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 101002102220113 its reverse (311022201200101), we get a palindrome (412024303420214).
The spelling of 101002102220113 in words is "one hundred one trillion, two billion, one hundred two million, two hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •