Base | Representation |
---|---|
bin | 10001011110100010011… |
… | …000100001000000000010 |
3 | 11020211001011102012122112 |
4 | 101132202120201000002 |
5 | 124134142133224302 |
6 | 2315424023135322 |
7 | 152525254232510 |
oct | 21364230410002 |
9 | 4224034365575 |
10 | 1201020211202 |
11 | 423393664949 |
12 | 1749232a4542 |
13 | 89342a80486 |
14 | 421b5c174b0 |
15 | 21394560552 |
hex | 117a2621002 |
1201020211202 has 8 divisors (see below), whose sum is σ = 2058891790656. Its totient is φ = 514722947652.
The previous prime is 1201020211201. The next prime is 1201020211207. The reversal of 1201020211202 is 2021120201021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 85787157943 = 1201020211202 / (1 + 2 + 0 + 1 + 0 + 2 + 0 + 2 + 1 + 1 + 2 + 0 + 2).
It is not an unprimeable number, because it can be changed into a prime (1201020211201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 42893578958 + ... + 42893578985.
It is an arithmetic number, because the mean of its divisors is an integer number (257361473832).
Almost surely, 21201020211202 is an apocalyptic number.
1201020211202 is a deficient number, since it is larger than the sum of its proper divisors (857871579454).
1201020211202 is an equidigital number, since it uses as much as digits as its factorization.
1201020211202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85787157952.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1201020211202 its reverse (2021120201021), we get a palindrome (3222140412223).
The spelling of 1201020211202 in words is "one trillion, two hundred one billion, twenty million, two hundred eleven thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •