Base | Representation |
---|---|
bin | 10011100010100101… |
… | …01011100100110001 |
3 | 1000002010000121002120 |
4 | 21301102223210301 |
5 | 132441102011243 |
6 | 4452551104453 |
7 | 520653054021 |
oct | 116122534461 |
9 | 30063017076 |
10 | 10490657073 |
11 | 44a377aa26 |
12 | 2049372129 |
13 | cb2550ac0 |
14 | 7173a5a81 |
15 | 415eccc83 |
hex | 2714ab931 |
10490657073 has 32 divisors (see below), whose sum is σ = 15439872000. Its totient is φ = 6296222016.
The previous prime is 10490657071. The next prime is 10490657087. The reversal of 10490657073 is 37075609401.
It is not a de Polignac number, because 10490657073 - 21 = 10490657071 is a prime.
It is a super-2 number, since 2×104906570732 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
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 31 ways as a sum of consecutive naturals, for example, 274278 + ... + 310176.
It is an arithmetic number, because the mean of its divisors is an integer number (482496000).
Almost surely, 210490657073 is an apocalyptic number.
10490657073 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10490657073 is a deficient number, since it is larger than the sum of its proper divisors (4949214927).
10490657073 is a wasteful number, since it uses less digits than its factorization.
10490657073 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36101.
The product of its (nonzero) digits is 158760, while the sum is 42.
The spelling of 10490657073 in words is "ten billion, four hundred ninety million, six hundred fifty-seven thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •