Base | Representation |
---|---|
bin | 10110101111001101010010… |
… | …000011001001100010010010 |
3 | 111010002000022121100220110102 |
4 | 112233031102003021202102 |
5 | 101101404223112004340 |
6 | 552403512101532402 |
7 | 30030561325004033 |
oct | 2657152203114222 |
9 | 433060277326412 |
10 | 100001100109970 |
11 | 29955256a97074 |
12 | b270a72114102 |
13 | 43a50a90349a7 |
14 | 1a9a116d7ca8a |
15 | b863d1178215 |
hex | 5af3520c9892 |
100001100109970 has 8 divisors (see below), whose sum is σ = 180001980197964. Its totient is φ = 40000440043984.
The previous prime is 100001100109969. The next prime is 100001100109973. The reversal of 100001100109970 is 79901001100001.
It can be written as a sum of positive squares in 2 ways, for example, as 92384565432721 + 7616534677249 = 9611689^2 + 2759807^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not an unprimeable number, because it can be changed into a prime (100001100109973) 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, 5000055005489 + ... + 5000055005508.
Almost surely, 2100001100109970 is an apocalyptic number.
100001100109970 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100001100109970 is a deficient number, since it is larger than the sum of its proper divisors (80000880087994).
100001100109970 is a wasteful number, since it uses less digits than its factorization.
100001100109970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10000110011004.
The product of its (nonzero) digits is 567, while the sum is 29.
Adding to 100001100109970 its reverse (79901001100001), we get a palindrome (179902101209971).
The spelling of 100001100109970 in words is "one hundred trillion, one billion, one hundred million, one hundred nine thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •