Base | Representation |
---|---|
bin | 10110110010011011000110… |
… | …101010110101000110111011 |
3 | 111010212010202110122121010111 |
4 | 112302123012222311012323 |
5 | 101114014330100014321 |
6 | 553053221440325151 |
7 | 30052544032043536 |
oct | 2662330652650673 |
9 | 433763673577114 |
10 | 100222100001211 |
11 | 29a2aa54736391 |
12 | b2a786a6137b7 |
13 | 43bcb98c2b2c6 |
14 | 1aa6ac0065a1d |
15 | b8c0180275e1 |
hex | 5b26c6ab51bb |
100222100001211 has 8 divisors (see below), whose sum is σ = 103887937382400. Its totient is φ = 96583316770920.
The previous prime is 100222100001119. The next prime is 100222100001263. The reversal of 100222100001211 is 112100001222001.
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 100222100001211 - 237 = 100084661047739 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100222100001191 and 100222100001200.
It is not an unprimeable number, because it can be changed into a prime (100222100005211) 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, 6763530181 + ... + 6763544998.
It is an arithmetic number, because the mean of its divisors is an integer number (12985992172800).
Almost surely, 2100222100001211 is an apocalyptic number.
100222100001211 is a deficient number, since it is larger than the sum of its proper divisors (3665837381189).
100222100001211 is a wasteful number, since it uses less digits than its factorization.
100222100001211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13527075449.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100222100001211 its reverse (112100001222001), we get a palindrome (212322101223212).
The spelling of 100222100001211 in words is "one hundred trillion, two hundred twenty-two billion, one hundred million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •