Base | Representation |
---|---|
bin | 10001011101110001100… |
… | …111010100111001011011 |
3 | 11020201221010211021212211 |
4 | 101131301213110321123 |
5 | 124131003203311303 |
6 | 2315210514215551 |
7 | 152466060522040 |
oct | 21356147247133 |
9 | 4221833737784 |
10 | 1200202010203 |
11 | 423003822379 |
12 | 1747352845b7 |
13 | 892423c6c81 |
14 | 421392b11c7 |
15 | 213477e066d |
hex | 117719d4e5b |
1200202010203 has 8 divisors (see below), whose sum is σ = 1384976523008. Its totient is φ = 1018756768104.
The previous prime is 1200202010153. The next prime is 1200202010221. The reversal of 1200202010203 is 3020102020021.
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 1200202010203 - 233 = 1191612075611 is a prime.
It is a super-2 number, since 2×12002020102032 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1200202010243) 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, 832316901 + ... + 832318342.
It is an arithmetic number, because the mean of its divisors is an integer number (173122065376).
Almost surely, 21200202010203 is an apocalyptic number.
1200202010203 is a deficient number, since it is larger than the sum of its proper divisors (184774512805).
1200202010203 is a wasteful number, since it uses less digits than its factorization.
1200202010203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1664635353.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 1200202010203 its reverse (3020102020021), we get a palindrome (4220304030224).
The spelling of 1200202010203 in words is "one trillion, two hundred billion, two hundred two million, ten thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •