Base | Representation |
---|---|
bin | 10110110010001111111011… |
… | …100010110110011100110001 |
3 | 111010210222210022200011002212 |
4 | 112302033323202312130301 |
5 | 101113320242130400423 |
6 | 553043515130021505 |
7 | 30051640515315563 |
oct | 2662177342663461 |
9 | 433728708604085 |
10 | 100210102200113 |
11 | 29a25958246894 |
12 | b2a5480577895 |
13 | 43bba06386609 |
14 | 1aa62a285b333 |
15 | b8ba64a8d578 |
hex | 5b23fb8b6731 |
100210102200113 has 4 divisors (see below), whose sum is σ = 100734762421248. Its totient is φ = 99685441978980.
The previous prime is 100210102200107. The next prime is 100210102200127. The reversal of 100210102200113 is 311002201012001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 100210102200113 - 236 = 100141382723377 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100210102200163) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 262330110281 + ... + 262330110662.
It is an arithmetic number, because the mean of its divisors is an integer number (25183690605312).
Almost surely, 2100210102200113 is an apocalyptic number.
It is an amenable number.
100210102200113 is a deficient number, since it is larger than the sum of its proper divisors (524660221135).
100210102200113 is an equidigital number, since it uses as much as digits as its factorization.
100210102200113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 524660221134.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 100210102200113 its reverse (311002201012001), we get a palindrome (411212303212114).
The spelling of 100210102200113 in words is "one hundred trillion, two hundred ten billion, one hundred two million, two hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •