Base | Representation |
---|---|
bin | 1001100000001000011000… |
… | …0001011010110101000000 |
3 | 1100222210002211111112112020 |
4 | 2120002012001122311000 |
5 | 2332133200344422343 |
6 | 34115322035001440 |
7 | 2125546330046502 |
oct | 230020601326500 |
9 | 40883084445466 |
10 | 10447608982848 |
11 | 33688959a1934 |
12 | 1208997139280 |
13 | 5aa28907451b |
14 | 28194a25dd72 |
15 | 131b76331b83 |
hex | 9808605ad40 |
10447608982848 has 224 divisors, whose sum is σ = 30042890465280. Its totient is φ = 3192099840000.
The previous prime is 10447608982801. The next prime is 10447608982891. The reversal of 10447608982848 is 84828980674401.
It is a super-2 number, since 2×104476089828482 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
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, 729523528 + ... + 729537848.
It is an arithmetic number, because the mean of its divisors is an integer number (134120046720).
Almost surely, 210447608982848 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 10447608982848, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15021445232640).
10447608982848 is an abundant number, since it is smaller than the sum of its proper divisors (19595281482432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10447608982848 is a wasteful number, since it uses less digits than its factorization.
10447608982848 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20837 (or 20827 counting only the distinct ones).
The product of its (nonzero) digits is 198180864, while the sum is 69.
The spelling of 10447608982848 in words is "ten trillion, four hundred forty-seven billion, six hundred eight million, nine hundred eighty-two thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •