Base | Representation |
---|---|
bin | 11011110000110010011111… |
… | …101110010010011001100110 |
3 | 121000022122110122002101100111 |
4 | 123300302133232102121212 |
5 | 112000441310030031042 |
6 | 1111403545323203234 |
7 | 34501302033526153 |
oct | 3360623756223146 |
9 | 530278418071314 |
10 | 122100010002022 |
11 | 359a5361561828 |
12 | 1183b97237651a |
13 | 5318c9b593220 |
14 | 222195a02522a |
15 | e1b17c696517 |
hex | 6f0c9fb92666 |
122100010002022 has 8 divisors (see below), whose sum is σ = 197238477695616. Its totient is φ = 56353850770152.
The previous prime is 122100010001971. The next prime is 122100010002023. The reversal of 122100010002022 is 220200010001221.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 122100010001993 and 122100010002011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122100010002023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2348077115398 + ... + 2348077115449.
It is an arithmetic number, because the mean of its divisors is an integer number (24654809711952).
Almost surely, 2122100010002022 is an apocalyptic number.
122100010002022 is a deficient number, since it is larger than the sum of its proper divisors (75138467693594).
122100010002022 is a wasteful number, since it uses less digits than its factorization.
122100010002022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4696154230862.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 122100010002022 its reverse (220200010001221), we get a palindrome (342300020003243).
The spelling of 122100010002022 in words is "one hundred twenty-two trillion, one hundred billion, ten million, two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •