Base | Representation |
---|---|
bin | 10110101111101000011000… |
… | …110010000100011001000101 |
3 | 111010011210102220122220021001 |
4 | 112233220120302010121011 |
5 | 101102343324222232323 |
6 | 552425124045253301 |
7 | 30032641464602260 |
oct | 2657503062043105 |
9 | 433153386586231 |
10 | 100030204102213 |
11 | 29966631485220 |
12 | b276634b64231 |
13 | 43a7a668a0588 |
14 | 1a9b6b83c9cd7 |
15 | b870362b33ad |
hex | 5afa18c84645 |
100030204102213 has 32 divisors (see below), whose sum is σ = 131306919920640. Its totient is φ = 73826283288960.
The previous prime is 100030204102111. The next prime is 100030204102219. The reversal of 100030204102213 is 312201402030001.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 100030204102213 - 29 = 100030204101701 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100030204102219) 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, 1452520 + ... + 14218657.
It is an arithmetic number, because the mean of its divisors is an integer number (4103341247520).
Almost surely, 2100030204102213 is an apocalyptic number.
It is an amenable number.
100030204102213 is a deficient number, since it is larger than the sum of its proper divisors (31276715818427).
100030204102213 is a wasteful number, since it uses less digits than its factorization.
100030204102213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15675577.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 100030204102213 its reverse (312201402030001), we get a palindrome (412231606132214).
The spelling of 100030204102213 in words is "one hundred trillion, thirty billion, two hundred four million, one hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •