Base | Representation |
---|---|
bin | 10001011111011110000… |
… | …110000111001110101011 |
3 | 11020220121222111100222111 |
4 | 101133132012013032223 |
5 | 124143220114120021 |
6 | 2320111251303151 |
7 | 152562140406061 |
oct | 21373606071653 |
9 | 4226558440874 |
10 | 1202022020011 |
11 | 42385810370a |
12 | 174b628aaab7 |
13 | 894724a1a57 |
14 | 4226ccb6031 |
15 | 2140249c8e1 |
hex | 117de1873ab |
1202022020011 has 8 divisors (see below), whose sum is σ = 1254334915584. Its totient is φ = 1149713380200.
The previous prime is 1202022020009. The next prime is 1202022020021. The reversal of 1202022020011 is 1100202202021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1202022020011 - 21 = 1202022020009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1202022019973 and 1202022020000.
It is not an unprimeable number, because it can be changed into a prime (1202022020021) 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 7 ways as a sum of consecutive naturals, for example, 479931 + ... + 1623076.
It is an arithmetic number, because the mean of its divisors is an integer number (156791864448).
Almost surely, 21202022020011 is an apocalyptic number.
1202022020011 is a deficient number, since it is larger than the sum of its proper divisors (52312895573).
1202022020011 is a wasteful number, since it uses less digits than its factorization.
1202022020011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2127881.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 1202022020011 its reverse (1100202202021), we get a palindrome (2302224222032).
The spelling of 1202022020011 in words is "one trillion, two hundred two billion, twenty-two million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •