Base | Representation |
---|---|
bin | 10010111001101111… |
… | …00010100000101000 |
3 | 222012020020200212000 |
4 | 21130313202200220 |
5 | 131240341411421 |
6 | 4354550451000 |
7 | 506322362142 |
oct | 113467424050 |
9 | 28166220760 |
10 | 10147997736 |
11 | 4338309998 |
12 | 1b72663a60 |
13 | c59567bb6 |
14 | 6c3a89c92 |
15 | 3e5d94226 |
hex | 25cde2828 |
10147997736 has 128 divisors (see below), whose sum is σ = 29815680000. Its totient is φ = 3189170880.
The previous prime is 10147997711. The next prime is 10147997747. The reversal of 10147997736 is 63779974101.
10147997736 is a `hidden beast` number, since 10 + 1 + 479 + 97 + 73 + 6 = 666.
It is a super-2 number, since 2×101479977362 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
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, 860085 + ... + 871803.
It is an arithmetic number, because the mean of its divisors is an integer number (232935000).
Almost surely, 210147997736 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 10147997736, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14907840000).
10147997736 is an abundant number, since it is smaller than the sum of its proper divisors (19667682264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10147997736 is a wasteful number, since it uses less digits than its factorization.
10147997736 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11964 (or 11954 counting only the distinct ones).
The product of its (nonzero) digits is 2000376, while the sum is 54.
The spelling of 10147997736 in words is "ten billion, one hundred forty-seven million, nine hundred ninety-seven thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •