Base | Representation |
---|---|
bin | 10111001100011110010000… |
… | …111100011001101011001001 |
3 | 111101012021022121121121022002 |
4 | 113030132100330121223021 |
5 | 101332331441200001301 |
6 | 1000543431400040345 |
7 | 30326065262012111 |
oct | 2714362074315311 |
9 | 441167277547262 |
10 | 102012200000201 |
11 | 2a5601494a1757 |
12 | b5367934630b5 |
13 | 44bc92b0c923a |
14 | 1b295b9aa2041 |
15 | bbd88887716b |
hex | 5cc790f19ac9 |
102012200000201 has 8 divisors (see below), whose sum is σ = 107260089482304. Its totient is φ = 96832025221360.
The previous prime is 102012200000153. The next prime is 102012200000279. The reversal of 102012200000201 is 102000002210201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102012200000201 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (102012200060201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16928672726 + ... + 16928678751.
It is an arithmetic number, because the mean of its divisors is an integer number (13407511185288).
Almost surely, 2102012200000201 is an apocalyptic number.
It is an amenable number.
102012200000201 is a deficient number, since it is larger than the sum of its proper divisors (5247889482103).
102012200000201 is a wasteful number, since it uses less digits than its factorization.
102012200000201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33857351631.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 102012200000201 its reverse (102000002210201), we get a palindrome (204012202210402).
The spelling of 102012200000201 in words is "one hundred two trillion, twelve billion, two hundred million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •