Base | Representation |
---|---|
bin | 10111000000111110010101… |
… | …011010110111000010100001 |
3 | 111021101201200021222220000120 |
4 | 113000332111122313002201 |
5 | 101231410124241024301 |
6 | 555140424555310453 |
7 | 30215022356202525 |
oct | 2700762532670241 |
9 | 437351607886016 |
10 | 101222001111201 |
11 | 2a2860118587a3 |
12 | b42960344b429 |
13 | 4463269881639 |
14 | 1add2572c9d85 |
15 | ba803ac57e36 |
hex | 5c0f956b70a1 |
101222001111201 has 8 divisors (see below), whose sum is σ = 134965122993600. Its totient is φ = 67480106651472.
The previous prime is 101222001111137. The next prime is 101222001111221. The reversal of 101222001111201 is 102111100222101.
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 101222001111201 - 26 = 101222001111137 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101222001111221) 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 7 ways as a sum of consecutive naturals, for example, 306663226 + ... + 306993123.
It is an arithmetic number, because the mean of its divisors is an integer number (16870640374200).
Almost surely, 2101222001111201 is an apocalyptic number.
It is an amenable number.
101222001111201 is a deficient number, since it is larger than the sum of its proper divisors (33743121882399).
101222001111201 is an equidigital number, since it uses as much as digits as its factorization.
101222001111201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 613711335.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 101222001111201 its reverse (102111100222101), we get a palindrome (203333101333302).
The spelling of 101222001111201 in words is "one hundred one trillion, two hundred twenty-two billion, one million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •