Base | Representation |
---|---|
bin | 10010110001110001… |
… | …00110000010111100 |
3 | 222000120111021021000 |
4 | 21120320212002330 |
5 | 131121234244000 |
6 | 4344202210300 |
7 | 504551331030 |
oct | 113070460274 |
9 | 28016437230 |
10 | 10081165500 |
11 | 430361193a |
12 | 1b541b3990 |
13 | c487681b3 |
14 | 6b8c501c0 |
15 | 3e0092000 |
hex | 258e260bc |
10081165500 has 384 divisors, whose sum is σ = 37664040960. Its totient is φ = 2280441600.
The previous prime is 10081165463. The next prime is 10081165517. The reversal of 10081165500 is 556118001.
10081165500 is a `hidden beast` number, since 1 + 0 + 0 + 8 + 1 + 1 + 655 + 0 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 10111002 + ... + 10111998.
It is an arithmetic number, because the mean of its divisors is an integer number (98083440).
Almost surely, 210081165500 is an apocalyptic number.
10081165500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10081165500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18832020480).
10081165500 is an abundant number, since it is smaller than the sum of its proper divisors (27582875460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10081165500 is a wasteful number, since it uses less digits than its factorization.
10081165500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1139 (or 1121 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 27.
The spelling of 10081165500 in words is "ten billion, eighty-one million, one hundred sixty-five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •