Base | Representation |
---|---|
bin | 10011100010010101… |
… | …11100000011000100 |
3 | 1000001222012110220100 |
4 | 21301022330003010 |
5 | 132440042034041 |
6 | 4452435404100 |
7 | 520626601422 |
oct | 116112740304 |
9 | 30058173810 |
10 | 10488627396 |
11 | 44a2614005 |
12 | 2048753630 |
13 | cb1cc0000 |
14 | 716dd8112 |
15 | 415c2b6b6 |
hex | 2712bc0c4 |
10488627396 has 135 divisors (see below), whose sum is σ = 29009446193. Its totient is φ = 3195316800.
The previous prime is 10488627379. The next prime is 10488627419. The reversal of 10488627396 is 69372688401.
The square root of 10488627396 is 102414.
It is a perfect power (a square), and thus also a powerful number.
10488627396 is a `hidden beast` number, since 1 + 0 + 4 + 8 + 8 + 627 + 3 + 9 + 6 = 666.
It can be written as a sum of positive squares in 7 ways, for example, as 7239627396 + 3249000000 = 85086^2 + 57000^2 .
It is a super-2 number, since 2×104886273962 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 103847746 + ... + 103847846.
Almost surely, 210488627396 is an apocalyptic number.
10488627396 is the 102414-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10488627396
10488627396 is an abundant number, since it is smaller than the sum of its proper divisors (18520818797).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10488627396 is an equidigital number, since it uses as much as digits as its factorization.
10488627396 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 264 (or 119 counting only the distinct ones).
The product of its (nonzero) digits is 3483648, while the sum is 54.
The spelling of 10488627396 in words is "ten billion, four hundred eighty-eight million, six hundred twenty-seven thousand, three hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •