Base | Representation |
---|---|
bin | 10110110000110100101011… |
… | …111100100100110100100101 |
3 | 111010110121220110200211101122 |
4 | 112300310223330210310211 |
5 | 101110214120240032323 |
6 | 552530513321503325 |
7 | 30041601623344550 |
oct | 2660645374446445 |
9 | 433417813624348 |
10 | 100112130002213 |
11 | 2999835251749a |
12 | b28a499941b45 |
13 | 43b26c1a06994 |
14 | 1aa164ac51697 |
15 | b8922d8a8ec8 |
hex | 5b0d2bf24d25 |
100112130002213 has 16 divisors (see below), whose sum is σ = 114581259386880. Its totient is φ = 85684875246000.
The previous prime is 100112130002177. The next prime is 100112130002231. The reversal of 100112130002213 is 312200031211001.
It is a cyclic number.
It is not a de Polignac number, because 100112130002213 - 28 = 100112130001957 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100112130002191 and 100112130002200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100112130002263) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 46280708 + ... + 48395538.
It is an arithmetic number, because the mean of its divisors is an integer number (7161328711680).
Almost surely, 2100112130002213 is an apocalyptic number.
It is an amenable number.
100112130002213 is a deficient number, since it is larger than the sum of its proper divisors (14469129384667).
100112130002213 is an equidigital number, since it uses as much as digits as its factorization.
100112130002213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2124728.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 100112130002213 its reverse (312200031211001), we get a palindrome (412312161213214).
The spelling of 100112130002213 in words is "one hundred trillion, one hundred twelve billion, one hundred thirty million, two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •