Base | Representation |
---|---|
bin | 10110101111011000010111… |
… | …010101110000001011110010 |
3 | 111010010011000221011122000210 |
4 | 112233120113111300023302 |
5 | 101102103111002024020 |
6 | 552413200554324550 |
7 | 30031462242455151 |
oct | 2657302725601362 |
9 | 433104027148023 |
10 | 100013000033010 |
11 | 2995a303204409 |
12 | b273233429756 |
13 | 43a625452997c |
14 | 1a9a925589598 |
15 | b8687ac2b3e0 |
hex | 5af6175702f2 |
100013000033010 has 32 divisors (see below), whose sum is σ = 243069569706240. Its totient is φ = 26332536716928.
The previous prime is 100013000032973. The next prime is 100013000033033. The reversal of 100013000033010 is 10330000310001.
It is a super-2 number, since 2×1000130000330102 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21099786667 + ... + 21099791406.
It is an arithmetic number, because the mean of its divisors is an integer number (7595924053320).
Almost surely, 2100013000033010 is an apocalyptic number.
100013000033010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100013000033010 is an abundant number, since it is smaller than the sum of its proper divisors (143056569673230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100013000033010 is a wasteful number, since it uses less digits than its factorization.
100013000033010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42199578162.
The product of its (nonzero) digits is 27, while the sum is 12.
Adding to 100013000033010 its reverse (10330000310001), we get a palindrome (110343000343011).
The spelling of 100013000033010 in words is "one hundred trillion, thirteen billion, thirty-three thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •