Base | Representation |
---|---|
bin | 10010110100000000… |
… | …11111001111011000 |
3 | 222001212221202210020 |
4 | 21122000133033120 |
5 | 131141100340432 |
6 | 4350114150440 |
7 | 505200454050 |
oct | 113200371730 |
9 | 28055852706 |
10 | 10100011992 |
11 | 4313214554 |
12 | 1b5a582420 |
13 | c4c636575 |
14 | 6bb558560 |
15 | 3e1a6622c |
hex | 25a01f3d8 |
10100011992 has 128 divisors (see below), whose sum is σ = 29570572800. Its totient is φ = 2815008768.
The previous prime is 10100011973. The next prime is 10100011993. The reversal of 10100011992 is 29911000101.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10100011993) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1590648 + ... + 1596984.
It is an arithmetic number, because the mean of its divisors is an integer number (231020100).
Almost surely, 210100011992 is an apocalyptic number.
10100011992 is a gapful number since it is divisible by the number (12) 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 10100011992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14785286400).
10100011992 is an abundant number, since it is smaller than the sum of its proper divisors (19470560808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10100011992 is a wasteful number, since it uses less digits than its factorization.
10100011992 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6585 (or 6581 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 24.
The spelling of 10100011992 in words is "ten billion, one hundred million, eleven thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •