Base | Representation |
---|---|
bin | 10010110110101101… |
… | …11011100100000000 |
3 | 222010110121001000000 |
4 | 21123112323210000 |
5 | 131212401004014 |
6 | 4352244000000 |
7 | 505564203246 |
oct | 113326734400 |
9 | 28113531000 |
10 | 10122672384 |
11 | 4324a91650 |
12 | 1b66090000 |
13 | c5423b896 |
14 | 6c0576796 |
15 | 3e3a40509 |
hex | 25b5bb900 |
10122672384 has 252 divisors, whose sum is σ = 33055625232. Its totient is φ = 3066854400.
The previous prime is 10122672383. The next prime is 10122672397. The reversal of 10122672384 is 48327622101.
It is a happy number.
10122672384 is a `hidden beast` number, since 1 + 0 + 12 + 267 + 2 + 384 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (10122672383) by changing a digit.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 2050399 + ... + 2055329.
It is an arithmetic number, because the mean of its divisors is an integer number (131173116).
Almost surely, 210122672384 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10122672384, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16527812616).
10122672384 is an abundant number, since it is smaller than the sum of its proper divisors (22932952848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10122672384 is an frugal number, since it uses more digits than its factorization.
10122672384 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4976 (or 4947 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 36.
The spelling of 10122672384 in words is "ten billion, one hundred twenty-two million, six hundred seventy-two thousand, three hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •