Base | Representation |
---|---|
bin | 1001001110010111111100… |
… | …1100000110111010110000 |
3 | 1022220121200212100012202202 |
4 | 2103211333030012322300 |
5 | 2312133421211310402 |
6 | 33323231322002332 |
7 | 2064526612460150 |
oct | 223457714067260 |
9 | 38817625305682 |
10 | 10142551666352 |
11 | 3260482aaa926 |
12 | 11798400463a8 |
13 | 587591569661 |
14 | 270c8b5ba760 |
15 | 128c6eb98b02 |
hex | 9397f306eb0 |
10142551666352 has 80 divisors (see below), whose sum is σ = 23792591319552. Its totient is φ = 4088877511680.
The previous prime is 10142551666349. The next prime is 10142551666391. The reversal of 10142551666352 is 25366615524101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 10142551666297 and 10142551666306.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2031563 + ... + 4940885.
Almost surely, 210142551666352 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 10142551666352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11896295659776).
10142551666352 is an abundant number, since it is smaller than the sum of its proper divisors (13650039653200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10142551666352 is a wasteful number, since it uses less digits than its factorization.
10142551666352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2911186 (or 2911180 counting only the distinct ones).
The product of its (nonzero) digits is 1296000, while the sum is 47.
The spelling of 10142551666352 in words is "ten trillion, one hundred forty-two billion, five hundred fifty-one million, six hundred sixty-six thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •