Base | Representation |
---|---|
bin | 10001011111011101011… |
… | …001000110100111010011 |
3 | 11020220121011021220210111 |
4 | 101133131121012213103 |
5 | 124143204104033021 |
6 | 2320110150342151 |
7 | 152561635204465 |
oct | 21373531064723 |
9 | 4226534256714 |
10 | 1202010221011 |
11 | 423851484976 |
12 | 174b5a95a957 |
13 | 8946cc003b2 |
14 | 4226b4c4135 |
15 | 2140141b8e1 |
hex | 117dd6469d3 |
1202010221011 has 4 divisors (see below), whose sum is σ = 1254271534992. Its totient is φ = 1149748907032.
The previous prime is 1202010220951. The next prime is 1202010221059. The reversal of 1202010221011 is 1101220102021.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1202010221011 - 211 = 1202010218963 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1202010220982 and 1202010221000.
It is not an unprimeable number, because it can be changed into a prime (1202010221411) 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 3 ways as a sum of consecutive naturals, for example, 26130656956 + ... + 26130657001.
It is an arithmetic number, because the mean of its divisors is an integer number (313567883748).
Almost surely, 21202010221011 is an apocalyptic number.
1202010221011 is a deficient number, since it is larger than the sum of its proper divisors (52261313981).
1202010221011 is an equidigital number, since it uses as much as digits as its factorization.
1202010221011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52261313980.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1202010221011 its reverse (1101220102021), we get a palindrome (2303230323032).
The spelling of 1202010221011 in words is "one trillion, two hundred two billion, ten million, two hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •