Base | Representation |
---|---|
bin | 101101100010111011001100… |
… | …110000011100010111010001 |
3 | 222021020122121001110222110112 |
4 | 231202323030300130113101 |
5 | 202223403210210031001 |
6 | 1550010041220211105 |
7 | 60123034032464030 |
oct | 5542731460342721 |
9 | 867218531428415 |
10 | 200312120002001 |
11 | 58909990684527 |
12 | 1a5719b7839a95 |
13 | 87a047607a0b7 |
14 | 37672306a0717 |
15 | 18258a07c4cbb |
hex | b62eccc1c5d1 |
200312120002001 has 16 divisors (see below), whose sum is σ = 229404066530304. Its totient is φ = 171339265201104.
The previous prime is 200312120001949. The next prime is 200312120002031. The reversal of 200312120002001 is 100200021213002.
It is a happy number.
200312120002001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-200312120002001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200312120002031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17437346 + ... + 26545908.
It is an arithmetic number, because the mean of its divisors is an integer number (14337754158144).
Almost surely, 2200312120002001 is an apocalyptic number.
It is an amenable number.
200312120002001 is a deficient number, since it is larger than the sum of its proper divisors (29091946528303).
200312120002001 is an equidigital number, since it uses as much as digits as its factorization.
200312120002001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9115100.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 200312120002001 its reverse (100200021213002), we get a palindrome (300512141215003).
The spelling of 200312120002001 in words is "two hundred trillion, three hundred twelve billion, one hundred twenty million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •