Base | Representation |
---|---|
bin | 101111110010110100001000… |
… | …001101001001111110100011 |
3 | 1000120020221021121201101000220 |
4 | 233302310020031021332203 |
5 | 210022404332304200003 |
6 | 2023020335124014123 |
7 | 62163313140524253 |
oct | 5762641015117643 |
9 | 1016227247641026 |
10 | 210200132100003 |
11 | 60a81414734221 |
12 | 1b6aa23ab31343 |
13 | 9039a30c08b46 |
14 | 39c9a525bd963 |
15 | 1947bc3d4c353 |
hex | bf2d08349fa3 |
210200132100003 has 16 divisors (see below), whose sum is σ = 292648766415360. Its totient is φ = 133950643288704.
The previous prime is 210200132099981. The next prime is 210200132100019. The reversal of 210200132100003 is 300001231002012.
It is not a de Polignac number, because 210200132100003 - 26 = 210200132099939 is a prime.
It is a super-2 number, since 2×2102001321000032 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (210200132100403) 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, 1022858551 + ... + 1023064032.
It is an arithmetic number, because the mean of its divisors is an integer number (18290547900960).
Almost surely, 2210200132100003 is an apocalyptic number.
210200132100003 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
210200132100003 is a deficient number, since it is larger than the sum of its proper divisors (82448634315357).
210200132100003 is a wasteful number, since it uses less digits than its factorization.
210200132100003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2045924098.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 210200132100003 its reverse (300001231002012), we get a palindrome (510201363102015).
The spelling of 210200132100003 in words is "two hundred ten trillion, two hundred billion, one hundred thirty-two million, one hundred thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •