Base | Representation |
---|---|
bin | 111000110011111010… |
… | …1010000110101000101 |
3 | 102122220110121000210000 |
4 | 1301213311100311011 |
5 | 3444324240200401 |
6 | 132014014551513 |
7 | 11546205145326 |
oct | 1614765206505 |
9 | 378813530700 |
10 | 122001100101 |
11 | 47816493261 |
12 | 1b789b08599 |
13 | b67395837a |
14 | 5c9500a44d |
15 | 32909d4186 |
hex | 1c67d50d45 |
122001100101 has 10 divisors (see below), whose sum is σ = 182248557062. Its totient is φ = 81334066680.
The previous prime is 122001100099. The next prime is 122001100237. The reversal of 122001100101 is 101001100221.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 121124880900 + 876219201 = 348030^2 + 29601^2 .
It is not a de Polignac number, because 122001100101 - 21 = 122001100099 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122001100601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 753093130 + ... + 753093291.
Almost surely, 2122001100101 is an apocalyptic number.
It is an amenable number.
122001100101 is a deficient number, since it is larger than the sum of its proper divisors (60247456961).
122001100101 is an equidigital number, since it uses as much as digits as its factorization.
122001100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1506186433 (or 1506186424 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 122001100101 its reverse (101001100221), we get a palindrome (223002200322).
The spelling of 122001100101 in words is "one hundred twenty-two billion, one million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •