Base | Representation |
---|---|
bin | 1001001011111001011110… |
… | …0000111111001100101000 |
3 | 1022202112220001220202002000 |
4 | 2102332113200333030220 |
5 | 2310434310042314401 |
6 | 33251514113011000 |
7 | 2061462444342150 |
oct | 222762740771450 |
9 | 38675801822060 |
10 | 10100010119976 |
11 | 3244432451437 |
12 | 1171548b53a60 |
13 | 583571a9c2ca |
14 | 26cbb3665760 |
15 | 127aceecb186 |
hex | 92f9783f328 |
10100010119976 has 128 divisors (see below), whose sum is σ = 32231396966400. Its totient is φ = 2870608628160.
The previous prime is 10100010119959. The next prime is 10100010120017. The reversal of 10100010119976 is 67991101000101.
It is a super-2 number, since 2×101000101199762 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 10100010119976.
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 31 ways as a sum of consecutive naturals, for example, 17197860 + ... + 17775443.
It is an arithmetic number, because the mean of its divisors is an integer number (251807788800).
Almost surely, 210100010119976 is an apocalyptic number.
It is an amenable number.
10100010119976 is an abundant number, since it is smaller than the sum of its proper divisors (22131386846424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10100010119976 is a wasteful number, since it uses less digits than its factorization.
10100010119976 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34973516 (or 34973506 counting only the distinct ones).
The product of its (nonzero) digits is 3402, while the sum is 36.
The spelling of 10100010119976 in words is "ten trillion, one hundred billion, ten million, one hundred nineteen thousand, nine hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •