Base | Representation |
---|---|
bin | 1001010001101111001100… |
… | …1111001101001001100101 |
3 | 1100010010211202111202210210 |
4 | 2110123303033031021211 |
5 | 2314110240300211323 |
6 | 33405545101010033 |
7 | 2101643523466536 |
oct | 224336317151145 |
9 | 40103752452723 |
10 | 10200333210213 |
11 | 3282a341a1a63 |
12 | 1188a86b53919 |
13 | 58cb6c5026b3 |
14 | 2739ad58a68d |
15 | 12a502786293 |
hex | 946f33cd265 |
10200333210213 has 16 divisors (see below), whose sum is σ = 13692939757056. Its totient is φ = 6754029629040.
The previous prime is 10200333210191. The next prime is 10200333210227. The reversal of 10200333210213 is 31201233300201.
It is not a de Polignac number, because 10200333210213 - 25 = 10200333210181 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10200333210213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10200333210713) 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 15 ways as a sum of consecutive naturals, for example, 6163695 + ... + 7641452.
It is an arithmetic number, because the mean of its divisors is an integer number (855808734816).
Almost surely, 210200333210213 is an apocalyptic number.
It is an amenable number.
10200333210213 is a deficient number, since it is larger than the sum of its proper divisors (3492606546843).
10200333210213 is a wasteful number, since it uses less digits than its factorization.
10200333210213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13806824.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 10200333210213 its reverse (31201233300201), we get a palindrome (41401566510414).
The spelling of 10200333210213 in words is "ten trillion, two hundred billion, three hundred thirty-three million, two hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •