Base | Representation |
---|---|
bin | 10110111110001100101001… |
… | …100101001010000010010110 |
3 | 111020201111012222002101201001 |
4 | 112332030221211022002112 |
5 | 101220243411101410402 |
6 | 554513033150453514 |
7 | 30165156435512335 |
oct | 2676145145120226 |
9 | 436644188071631 |
10 | 101031213310102 |
11 | 2a212108042a19 |
12 | b3b8638b0429a |
13 | 444b282c7b43a |
14 | 1ad3d18899d1c |
15 | ba30c1429187 |
hex | 5be32994a096 |
101031213310102 has 4 divisors (see below), whose sum is σ = 151546819965156. Its totient is φ = 50515606655050.
The previous prime is 101031213310087. The next prime is 101031213310109. The reversal of 101031213310102 is 201013312130101.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×1010312133101022 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101031213310102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101031213310109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25257803327524 + ... + 25257803327527.
It is an arithmetic number, because the mean of its divisors is an integer number (37886704991289).
Almost surely, 2101031213310102 is an apocalyptic number.
101031213310102 is a deficient number, since it is larger than the sum of its proper divisors (50515606655054).
101031213310102 is an equidigital number, since it uses as much as digits as its factorization.
101031213310102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50515606655053.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 101031213310102 its reverse (201013312130101), we get a palindrome (302044525440203).
The spelling of 101031213310102 in words is "one hundred one trillion, thirty-one billion, two hundred thirteen million, three hundred ten thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.524 sec. • engine limits •