Base | Representation |
---|---|
bin | 10011100011011001… |
… | …10001100100111000 |
3 | 1000002120220010021000 |
4 | 21301230301210320 |
5 | 132444324404100 |
6 | 4453353445000 |
7 | 521065153455 |
oct | 116154614470 |
9 | 30076803230 |
10 | 10497497400 |
11 | 44a7622195 |
12 | 204b710760 |
13 | cb3aa7430 |
14 | 71826682c |
15 | 4168ce900 |
hex | 271b31938 |
10497497400 has 384 divisors, whose sum is σ = 39169368000. Its totient is φ = 2568775680.
The previous prime is 10497497389. The next prime is 10497497407. The reversal of 10497497400 is 479479401.
It is a super-2 number, since 2×104974974002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10497497407) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 16075474 + ... + 16076126.
Almost surely, 210497497400 is an apocalyptic number.
10497497400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10497497400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19584684000).
10497497400 is an abundant number, since it is smaller than the sum of its proper divisors (28671870600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10497497400 is a wasteful number, since it uses less digits than its factorization.
10497497400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 920 (or 905 counting only the distinct ones).
The product of its (nonzero) digits is 254016, while the sum is 45.
The spelling of 10497497400 in words is "ten billion, four hundred ninety-seven million, four hundred ninety-seven thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •