Base | Representation |
---|---|
bin | 10001011111011110000… |
… | …010101100000010100011 |
3 | 11020220121220210202102122 |
4 | 101133132002230002203 |
5 | 124143214401402321 |
6 | 2320111220134455 |
7 | 152562126646430 |
oct | 21373602540243 |
9 | 4226556722378 |
10 | 1202021122211 |
11 | 423857650128 |
12 | 174b6253742b |
13 | 89472249200 |
14 | 4226cb20b87 |
15 | 214023718ab |
hex | 117de0ac0a3 |
1202021122211 has 12 divisors (see below), whose sum is σ = 1487539243152. Its totient is φ = 951049678176.
The previous prime is 1202021122201. The next prime is 1202021122213. The reversal of 1202021122211 is 1122211202021.
It is not a de Polignac number, because 1202021122211 - 226 = 1201954013347 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1202021122211.
It is not an unprimeable number, because it can be changed into a prime (1202021122213) 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 11 ways as a sum of consecutive naturals, for example, 508038176 + ... + 508040541.
It is an arithmetic number, because the mean of its divisors is an integer number (123961603596).
Almost surely, 21202021122211 is an apocalyptic number.
1202021122211 is a deficient number, since it is larger than the sum of its proper divisors (285518120941).
1202021122211 is a wasteful number, since it uses less digits than its factorization.
1202021122211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1016078750 (or 1016078737 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 1202021122211 its reverse (1122211202021), we get a palindrome (2324232324232).
The spelling of 1202021122211 in words is "one trillion, two hundred two billion, twenty-one million, one hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •