Base | Representation |
---|---|
bin | 11011110000110100011100… |
… | …010110110100001100101001 |
3 | 121000022211212100200010201010 |
4 | 123300310130112310030221 |
5 | 112001010100324013001 |
6 | 1111404533020414133 |
7 | 34501404613654122 |
oct | 3360643426641451 |
9 | 530284770603633 |
10 | 122102101001001 |
11 | 359a6234902260 |
12 | 118402566a7349 |
13 | 531924284c124 |
14 | 2221ab7a0b049 |
15 | e1b2510318d6 |
hex | 6f0d1c5b4329 |
122102101001001 has 16 divisors (see below), whose sum is σ = 177606774540288. Its totient is φ = 73999723942800.
The previous prime is 122102101000981. The next prime is 122102101001009. The reversal of 122102101001001 is 100100101201221.
It is not a de Polignac number, because 122102101001001 - 217 = 122102100869929 is a prime.
It is not an unprimeable number, because it can be changed into a prime (122102101001009) 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 15 ways as a sum of consecutive naturals, for example, 37133781 + ... + 40287986.
It is an arithmetic number, because the mean of its divisors is an integer number (11100423408768).
Almost surely, 2122102101001001 is an apocalyptic number.
122102101001001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
122102101001001 is a deficient number, since it is larger than the sum of its proper divisors (55504673539287).
122102101001001 is a wasteful number, since it uses less digits than its factorization.
122102101001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77469572.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 122102101001001 its reverse (100100101201221), we get a palindrome (222202202202222).
The spelling of 122102101001001 in words is "one hundred twenty-two trillion, one hundred two billion, one hundred one million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •