Base | Representation |
---|---|
bin | 11011101111101001110111… |
… | …001010110011101011110011 |
3 | 121000001012011101112000020001 |
4 | 123233221313022303223303 |
5 | 111443202044132414303 |
6 | 1111304050415130431 |
7 | 34462541261255443 |
oct | 3357516712635363 |
9 | 530035141460201 |
10 | 122022020201203 |
11 | 35975280329091 |
12 | 11828827813a17 |
13 | 531181ca66ba5 |
14 | 221bc7c23c123 |
15 | e1911590231d |
hex | 6efa772b3af3 |
122022020201203 has 32 divisors (see below), whose sum is σ = 132985083513600. Its totient is φ = 111519775382400.
The previous prime is 122022020201141. The next prime is 122022020201231. The reversal of 122022020201203 is 302102020220221.
It is a cyclic number.
It is not a de Polignac number, because 122022020201203 - 225 = 122021986646771 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122022020201273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6143790493 + ... + 6143810353.
It is an arithmetic number, because the mean of its divisors is an integer number (4155783859800).
Almost surely, 2122022020201203 is an apocalyptic number.
122022020201203 is a deficient number, since it is larger than the sum of its proper divisors (10963063312397).
122022020201203 is a wasteful number, since it uses less digits than its factorization.
122022020201203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28723.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 122022020201203 its reverse (302102020220221), we get a palindrome (424124040421424).
The spelling of 122022020201203 in words is "one hundred twenty-two trillion, twenty-two billion, twenty million, two hundred one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •