Base | Representation |
---|---|
bin | 101110100111000101… |
… | …0000011001010011010 |
3 | 100120100211100111112210 |
4 | 1131032022003022122 |
5 | 3114443422130200 |
6 | 113552214015550 |
7 | 10142313516612 |
oct | 1351612031232 |
9 | 316324314483 |
10 | 100095505050 |
11 | 394a53374a2 |
12 | 174959475b6 |
13 | 959253b2c8 |
14 | 4bb7a01a42 |
15 | 290c802650 |
hex | 174e28329a |
100095505050 has 48 divisors (see below), whose sum is σ = 248305839552. Its totient is φ = 26684716800.
The previous prime is 100095505001. The next prime is 100095505087. The reversal of 100095505050 is 50505590001.
It is a super-2 number, since 2×1000955050502 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 100095504999 and 100095505017.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 459762 + ... + 641538.
It is an arithmetic number, because the mean of its divisors is an integer number (5173038324).
Almost surely, 2100095505050 is an apocalyptic number.
100095505050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100095505050 is an abundant number, since it is smaller than the sum of its proper divisors (148210334502).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100095505050 is a wasteful number, since it uses less digits than its factorization.
100095505050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185463 (or 185458 counting only the distinct ones).
The product of its (nonzero) digits is 5625, while the sum is 30.
The spelling of 100095505050 in words is "one hundred billion, ninety-five million, five hundred five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •