Base | Representation |
---|---|
bin | 10110110000110011110101… |
… | …001110101011011111000101 |
3 | 111010110112112111022112202220 |
4 | 112300303311032223133011 |
5 | 101110210230233014341 |
6 | 552530242245522553 |
7 | 30041540105434041 |
oct | 2660636516533705 |
9 | 433415474275686 |
10 | 100111212001221 |
11 | 29997a2130a793 |
12 | b28a282413459 |
13 | 43b25a6779a25 |
14 | 1aa15a0d6b021 |
15 | b891c7ec3a66 |
hex | 5b0cf53ab7c5 |
100111212001221 has 16 divisors (see below), whose sum is σ = 140516470026240. Its totient is φ = 63223856279280.
The previous prime is 100111212001201. The next prime is 100111212001247. The reversal of 100111212001221 is 122100212111001.
It is a happy number.
It is not a de Polignac number, because 100111212001221 - 25 = 100111212001189 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 100111212001221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100111212001201) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 58561315 + ... + 60246576.
It is an arithmetic number, because the mean of its divisors is an integer number (8782279376640).
Almost surely, 2100111212001221 is an apocalyptic number.
It is an amenable number.
100111212001221 is a deficient number, since it is larger than the sum of its proper divisors (40405258025019).
100111212001221 is a wasteful number, since it uses less digits than its factorization.
100111212001221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118822696.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 100111212001221 its reverse (122100212111001), we get a palindrome (222211424112222).
The spelling of 100111212001221 in words is "one hundred trillion, one hundred eleven billion, two hundred twelve million, one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •