Base | Representation |
---|---|
bin | 1001010001101110010111… |
… | …1100001001110101110111 |
3 | 1100010010021012201012202102 |
4 | 2110123211330021311313 |
5 | 2314104311142041434 |
6 | 33405511011132315 |
7 | 2101635144261014 |
oct | 224334574116567 |
9 | 40103235635672 |
10 | 10200110112119 |
11 | 328292a273074 |
12 | 1188a242a409b |
13 | 58cb3521baa5 |
14 | 27398bab470b |
15 | 12a4dcdb807e |
hex | 946e5f09d77 |
10200110112119 has 8 divisors (see below), whose sum is σ = 10662233442432. Its totient is φ = 9739540138680.
The previous prime is 10200110112079. The next prime is 10200110112149. The reversal of 10200110112119 is 91121101100201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10200110112119 - 216 = 10200110046583 is a prime.
It is a super-2 number, since 2×102001101121192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10200110112119.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10200110112149) 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, 388325789 + ... + 388352054.
It is an arithmetic number, because the mean of its divisors is an integer number (1332779180304).
Almost surely, 210200110112119 is an apocalyptic number.
10200110112119 is a deficient number, since it is larger than the sum of its proper divisors (462123330313).
10200110112119 is an equidigital number, since it uses as much as digits as its factorization.
10200110112119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 776678437.
The product of its (nonzero) digits is 36, while the sum is 20.
The spelling of 10200110112119 in words is "ten trillion, two hundred billion, one hundred ten million, one hundred twelve thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •