Base | Representation |
---|---|
bin | 10110111110000010010011… |
… | …001111110100110100111011 |
3 | 111020200102112112200202222111 |
4 | 112332002103033310310323 |
5 | 101220103131401414321 |
6 | 554503554355433151 |
7 | 30164314165242403 |
oct | 2676022317646473 |
9 | 436612475622874 |
10 | 101020101201211 |
11 | 2a2084255a3055 |
12 | b3b64575b57b7 |
13 | 444a201a6088a |
14 | 1ad3582b65803 |
15 | ba2b70ae25e1 |
hex | 5be0933f4d3b |
101020101201211 has 8 divisors (see below), whose sum is σ = 104585388207120. Its totient is φ = 97460269878048.
The previous prime is 101020101201209. The next prime is 101020101201233. The reversal of 101020101201211 is 112102101020101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101020101201211 - 21 = 101020101201209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101020101201191 and 101020101201200.
It is not an unprimeable number, because it can be changed into a prime (101020101201511) 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, 1363883001 + ... + 1363957066.
It is an arithmetic number, because the mean of its divisors is an integer number (13073173525890).
Almost surely, 2101020101201211 is an apocalyptic number.
101020101201211 is a deficient number, since it is larger than the sum of its proper divisors (3565287005909).
101020101201211 is a wasteful number, since it uses less digits than its factorization.
101020101201211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2727841373.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101020101201211 its reverse (112102101020101), we get a palindrome (213122202221312).
The spelling of 101020101201211 in words is "one hundred one trillion, twenty billion, one hundred one million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •