Base | Representation |
---|---|
bin | 10110111101111010000001… |
… | …011010010000001001110110 |
3 | 111020122120121001010002012011 |
4 | 112331322001122100021312 |
5 | 101214431430233310402 |
6 | 554455524333314434 |
7 | 30163550666332342 |
oct | 2675720132201166 |
9 | 436576531102164 |
10 | 101011212010102 |
11 | 2a204683906219 |
12 | b3b4796635a1a |
13 | 4449416239b94 |
14 | 1ad2d7c356622 |
15 | ba2800502ed7 |
hex | 5bde81690276 |
101011212010102 has 8 divisors (see below), whose sum is σ = 152932863043656. Its totient is φ = 50033590995552.
The previous prime is 101011212010061. The next prime is 101011212010103. The reversal of 101011212010102 is 201010212110101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101011212010103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 236007504483 + ... + 236007504910.
It is an arithmetic number, because the mean of its divisors is an integer number (19116607880457).
Almost surely, 2101011212010102 is an apocalyptic number.
101011212010102 is a deficient number, since it is larger than the sum of its proper divisors (51921651033554).
101011212010102 is a wasteful number, since it uses less digits than its factorization.
101011212010102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 472015009502.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101011212010102 its reverse (201010212110101), we get a palindrome (302021424120203).
Subtracting 101011212010102 from its reverse (201010212110101), we obtain a palindrome (99999000099999).
The spelling of 101011212010102 in words is "one hundred one trillion, eleven billion, two hundred twelve million, ten thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •