Base | Representation |
---|---|
bin | 1001010001101101111101… |
… | …1100010110000010110101 |
3 | 1100010002222121121100020012 |
4 | 2110123133130112002311 |
5 | 2314104100241011242 |
6 | 33405452114550005 |
7 | 2101632351624113 |
oct | 224333734260265 |
9 | 40102877540205 |
10 | 10200001110197 |
11 | 3282883793338 |
12 | 11889b3898305 |
13 | 58cb18775b02 |
14 | 27397b41cab3 |
15 | 12a4d3536282 |
hex | 946df7160b5 |
10200001110197 has 16 divisors (see below), whose sum is σ = 10933561941120. Its totient is φ = 9490730622912.
The previous prime is 10200001110139. The next prime is 10200001110209. The reversal of 10200001110197 is 79101110000201.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 10200001110197 - 28 = 10200001109941 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10200001119197) 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, 2524079 + ... + 5174067.
It is an arithmetic number, because the mean of its divisors is an integer number (683347621320).
Almost surely, 210200001110197 is an apocalyptic number.
It is an amenable number.
10200001110197 is a deficient number, since it is larger than the sum of its proper divisors (733560830923).
10200001110197 is a wasteful number, since it uses less digits than its factorization.
10200001110197 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2654572.
The product of its (nonzero) digits is 126, while the sum is 23.
Adding to 10200001110197 its reverse (79101110000201), we get a palindrome (89301111110398).
The spelling of 10200001110197 in words is "ten trillion, two hundred billion, one million, one hundred ten thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •