Base | Representation |
---|---|
bin | 10001011111011110000… |
… | …110011011000010000001 |
3 | 11020220121222122111020120 |
4 | 101133132012123002001 |
5 | 124143220124213441 |
6 | 2320111253130453 |
7 | 152562141164412 |
oct | 21373606330201 |
9 | 4226558574216 |
10 | 1202022101121 |
11 | 423858159646 |
12 | 174b62929a29 |
13 | 894724cc94a |
14 | 4226ccd7809 |
15 | 214024b6966 |
hex | 117de19b081 |
1202022101121 has 8 divisors (see below), whose sum is σ = 1602762466944. Its totient is φ = 801314901360.
The previous prime is 1202022101083. The next prime is 1202022101153. The reversal of 1202022101121 is 1211012202021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1202022101121 - 217 = 1202021970049 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1202022101121.
It is not an unprimeable number, because it can be changed into a prime (1202023101121) 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 7 ways as a sum of consecutive naturals, for example, 8206825 + ... + 8352006.
It is an arithmetic number, because the mean of its divisors is an integer number (200345308368).
Almost surely, 21202022101121 is an apocalyptic number.
It is an amenable number.
1202022101121 is a deficient number, since it is larger than the sum of its proper divisors (400740365823).
1202022101121 is a wasteful number, since it uses less digits than its factorization.
1202022101121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16583031.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1202022101121 its reverse (1211012202021), we get a palindrome (2413034303142).
The spelling of 1202022101121 in words is "one trillion, two hundred two billion, twenty-two million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •