Base | Representation |
---|---|
bin | 1001001101111101100110… |
… | …0110101111100000000000 |
3 | 1022212221102221020102102212 |
4 | 2103133121212233200000 |
5 | 2312024430014210133 |
6 | 33320101415001252 |
7 | 2064156416105465 |
oct | 223373146574000 |
9 | 38787387212385 |
10 | 10135478663168 |
11 | 3258483523951 |
12 | 11783a7369228 |
13 | 586a050b2c81 |
14 | 2707ba09966c |
15 | 1289a8c5e148 |
hex | 937d99af800 |
10135478663168 has 192 divisors, whose sum is σ = 20939772672000. Its totient is φ = 4902286950400.
The previous prime is 10135478663137. The next prime is 10135478663171. The reversal of 10135478663168 is 86136687453101.
It is a Harshad number since it is a multiple of its sum of digits (59).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7043417393 + ... + 7043418831.
It is an arithmetic number, because the mean of its divisors is an integer number (109061316000).
Almost surely, 210135478663168 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 10135478663168, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10469886336000).
10135478663168 is an abundant number, since it is smaller than the sum of its proper divisors (10804294008832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10135478663168 is an equidigital number, since it uses as much as digits as its factorization.
10135478663168 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2412 (or 2392 counting only the distinct ones).
The product of its (nonzero) digits is 17418240, while the sum is 59.
The spelling of 10135478663168 in words is "ten trillion, one hundred thirty-five billion, four hundred seventy-eight million, six hundred sixty-three thousand, one hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •