Base | Representation |
---|---|
bin | 1001010001101101111101… |
… | …1100011000011111011101 |
3 | 1100010002222121121211222110 |
4 | 2110123133130120133131 |
5 | 2314104100241321341 |
6 | 33405452115104233 |
7 | 2101632351665253 |
oct | 224333734303735 |
9 | 40102877554873 |
10 | 10200001120221 |
11 | 328288379a920 |
12 | 11889b38a2079 |
13 | 58cb1877a543 |
14 | 27397b4225d3 |
15 | 12a4d3539216 |
hex | 946df7187dd |
10200001120221 has 32 divisors (see below), whose sum is σ = 15102437898240. Its totient is φ = 6071158166400.
The previous prime is 10200001120139. The next prime is 10200001120247. The reversal of 10200001120221 is 12202110000201.
It is not a de Polignac number, because 10200001120221 - 210 = 10200001119197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10200001120197 and 10200001120206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10200001120121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 524485 + ... + 4546986.
It is an arithmetic number, because the mean of its divisors is an integer number (471951184320).
Almost surely, 210200001120221 is an apocalyptic number.
10200001120221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10200001120221 is a deficient number, since it is larger than the sum of its proper divisors (4902436778019).
10200001120221 is a wasteful number, since it uses less digits than its factorization.
10200001120221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5072577.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10200001120221 its reverse (12202110000201), we get a palindrome (22402111120422).
The spelling of 10200001120221 in words is "ten trillion, two hundred billion, one million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.202 sec. • engine limits •