Base | Representation |
---|---|
bin | 10011100010100101… |
… | …01011100100110000 |
3 | 1000002010000121002112 |
4 | 21301102223210300 |
5 | 132441102011242 |
6 | 4452551104452 |
7 | 520653054020 |
oct | 116122534460 |
9 | 30063017075 |
10 | 10490657072 |
11 | 44a377aa25 |
12 | 2049372128 |
13 | cb2550abc |
14 | 7173a5a80 |
15 | 415eccc82 |
hex | 2714ab930 |
10490657072 has 20 divisors (see below), whose sum is σ = 23229312336. Its totient is φ = 4495995840.
The previous prime is 10490657071. The next prime is 10490657087. The reversal of 10490657072 is 27075609401.
It is a super-2 number, since 2×104906570722 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10490657071) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 46833179 + ... + 46833402.
Almost surely, 210490657072 is an apocalyptic number.
It is an amenable number.
10490657072 is an abundant number, since it is smaller than the sum of its proper divisors (12738655264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10490657072 is an equidigital number, since it uses as much as digits as its factorization.
10490657072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93666596 (or 93666590 counting only the distinct ones).
The product of its (nonzero) digits is 105840, while the sum is 41.
The spelling of 10490657072 in words is "ten billion, four hundred ninety million, six hundred fifty-seven thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •