Base | Representation |
---|---|
bin | 101111000010011001… |
… | …1000000011000010101 |
3 | 100122201201022000000012 |
4 | 1132010303000120111 |
5 | 3123333111224341 |
6 | 114223202130005 |
7 | 10204114425425 |
oct | 1360463003025 |
9 | 318651260005 |
10 | 101012211221 |
11 | 3992583a3a9 |
12 | 176b0950905 |
13 | 96aa433aac |
14 | 4c6366a485 |
15 | 296302e0eb |
hex | 1784cc0615 |
101012211221 has 8 divisors (see below), whose sum is σ = 101203971264. Its totient is φ = 100820524480.
The previous prime is 101012211217. The next prime is 101012211239. The reversal of 101012211221 is 122112210101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101012211221 - 22 = 101012211217 is a prime.
It is a super-3 number, since 3×1010122112213 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101012211196 and 101012211205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101012211121) 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, 3300230 + ... + 3330696.
It is an arithmetic number, because the mean of its divisors is an integer number (12650496408).
Almost surely, 2101012211221 is an apocalyptic number.
It is an amenable number.
101012211221 is a deficient number, since it is larger than the sum of its proper divisors (191760043).
101012211221 is an equidigital number, since it uses as much as digits as its factorization.
101012211221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36651.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101012211221 its reverse (122112210101), we get a palindrome (223124421322).
The spelling of 101012211221 in words is "one hundred one billion, twelve million, two hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •