Base | Representation |
---|---|
bin | 10110111111010110001101… |
… | …100011011110000111101000 |
3 | 111021000001002200111000221021 |
4 | 112333112031203132013220 |
5 | 101223042142200013000 |
6 | 555013215025422224 |
7 | 30203654004352111 |
oct | 2677261543360750 |
9 | 437001080430837 |
10 | 101110200001000 |
11 | 2a24265aa65963 |
12 | b40ba0149a974 |
13 | 4455860196268 |
14 | 1ad7a8cc21208 |
15 | ba519598811a |
hex | 5bf58d8de1e8 |
101110200001000 has 32 divisors (see below), whose sum is σ = 236597868004680. Its totient is φ = 40444080000000.
The previous prime is 101110200000959. The next prime is 101110200001021. The reversal of 101110200001000 is 100002011101.
It can be written as a sum of positive squares in 4 ways, for example, as 43808539915204 + 57301660085796 = 6618802^2 + 7569786^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50555099001 + ... + 50555101000.
Almost surely, 2101110200001000 is an apocalyptic number.
101110200001000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101110200001000 is an abundant number, since it is smaller than the sum of its proper divisors (135487668003680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101110200001000 is a wasteful number, since it uses less digits than its factorization.
101110200001000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101110200022 (or 101110200008 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 101110200001000 its reverse (100002011101), we get a palindrome (101210202012101).
The spelling of 101110200001000 in words is "one hundred one trillion, one hundred ten billion, two hundred million, one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •