Base | Representation |
---|---|
bin | 10010111001101101… |
… | …01011000010001000 |
3 | 222012012211011011000 |
4 | 21130312223002020 |
5 | 131240312124004 |
6 | 4354541535000 |
7 | 506320424514 |
oct | 113466530210 |
9 | 28165734130 |
10 | 10147770504 |
11 | 43381741a3 |
12 | 1b72574460 |
13 | c594b8641 |
14 | 6c3a2b144 |
15 | 3e5d4bc39 |
hex | 25cdab088 |
10147770504 has 128 divisors (see below), whose sum is σ = 28781827200. Its totient is φ = 3311642880.
The previous prime is 10147770491. The next prime is 10147770571. The reversal of 10147770504 is 40507774101.
10147770504 is a `hidden beast` number, since 1 + 0 + 14 + 77 + 70 + 504 = 666.
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9283782 + ... + 9284874.
It is an arithmetic number, because the mean of its divisors is an integer number (224858025).
Almost surely, 210147770504 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 10147770504, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14390913600).
10147770504 is an abundant number, since it is smaller than the sum of its proper divisors (18634056696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10147770504 is a wasteful number, since it uses less digits than its factorization.
10147770504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1972 (or 1962 counting only the distinct ones).
The product of its (nonzero) digits is 27440, while the sum is 36.
The spelling of 10147770504 in words is "ten billion, one hundred forty-seven million, seven hundred seventy thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •