Base | Representation |
---|---|
bin | 10110110000101011010000… |
… | …001101011111111100001000 |
3 | 111010102122202120012012202221 |
4 | 112300223100031133330020 |
5 | 101110032344224001300 |
6 | 552522120250103424 |
7 | 30041062621266463 |
oct | 2660532015377410 |
9 | 433378676165687 |
10 | 100102001000200 |
11 | 29994024a02351 |
12 | b28853171ab74 |
13 | 43b1769390074 |
14 | 1aa0d6990c2da |
15 | b88d3951831a |
hex | 5b0ad035ff08 |
100102001000200 has 48 divisors (see below), whose sum is σ = 233069160001860. Its totient is φ = 39983680800000.
The previous prime is 100102001000107. The next prime is 100102001000273. The reversal of 100102001000200 is 2000100201001.
It can be written as a sum of positive squares in 6 ways, for example, as 66005907857604 + 34096093142596 = 8124402^2 + 5839186^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 356856951 + ... + 357137350.
Almost surely, 2100102001000200 is an apocalyptic number.
100102001000200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100102001000200 is an abundant number, since it is smaller than the sum of its proper divisors (132967159001660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100102001000200 is a wasteful number, since it uses less digits than its factorization.
100102001000200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 713995018 (or 713995009 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 100102001000200 its reverse (2000100201001), we get a palindrome (102102101201201).
The spelling of 100102001000200 in words is "one hundred trillion, one hundred two billion, one million, two hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •