Base | Representation |
---|---|
bin | 10011100010100000… |
… | …10111010110100000 |
3 | 1000002001212202021121 |
4 | 21301100113112200 |
5 | 132440423044302 |
6 | 4452530102024 |
7 | 520644645004 |
oct | 116120272640 |
9 | 30061782247 |
10 | 10490049952 |
11 | 44a33a5878 |
12 | 204911a914 |
13 | cb239a665 |
14 | 717288704 |
15 | 415e0ce37 |
hex | 2714175a0 |
10490049952 has 48 divisors (see below), whose sum is σ = 21244077792. Its totient is φ = 5096805120.
The previous prime is 10490049923. The next prime is 10490049961. The reversal of 10490049952 is 25994009401.
It is a super-2 number, since 2×104900499522 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10490049899 and 10490049908.
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, 129643 + ... + 194389.
It is an arithmetic number, because the mean of its divisors is an integer number (442584954).
Almost surely, 210490049952 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 10490049952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10622038896).
10490049952 is an abundant number, since it is smaller than the sum of its proper divisors (10754027840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10490049952 is an equidigital number, since it uses as much as digits as its factorization.
10490049952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64901 (or 64893 counting only the distinct ones).
The product of its (nonzero) digits is 116640, while the sum is 43.
The spelling of 10490049952 in words is "ten billion, four hundred ninety million, forty-nine thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •