Base | Representation |
---|---|
bin | 1001101100001001101000… |
… | …0111111000001011000000 |
3 | 1101201112002212112022210112 |
4 | 2123002122013320023000 |
5 | 2344024101242303212 |
6 | 34354232245450452 |
7 | 2146506434213045 |
oct | 233023207701300 |
9 | 41645085468715 |
10 | 10654104650432 |
11 | 3438420361251 |
12 | 1240a06110a28 |
13 | 5c38a7058589 |
14 | 28b938cd91cc |
15 | 13720eb9d422 |
hex | 9b09a1f82c0 |
10654104650432 has 56 divisors (see below), whose sum is σ = 21732935760864. Its totient is φ = 5178351900672.
The previous prime is 10654104650407. The next prime is 10654104650479. The reversal of 10654104650432 is 23405640145601.
It is a super-2 number, since 2×106541046504322 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10654104650432.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 547013 + ... + 4648379.
Almost surely, 210654104650432 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 10654104650432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10866467880432).
10654104650432 is an abundant number, since it is smaller than the sum of its proper divisors (11078831110432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10654104650432 is a wasteful number, since it uses less digits than its factorization.
10654104650432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4102513 (or 4102503 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 41.
The spelling of 10654104650432 in words is "ten trillion, six hundred fifty-four billion, one hundred four million, six hundred fifty thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •