Base | Representation |
---|---|
bin | 10011100010100010… |
… | …10111000100010111 |
3 | 1000002002101000021122 |
4 | 21301101113010113 |
5 | 132441004422220 |
6 | 4452535434155 |
7 | 520650112616 |
oct | 116121270427 |
9 | 30062330248 |
10 | 10490310935 |
11 | 44a3563965 |
12 | 204922595b |
13 | cb245c3a0 |
14 | 71731587d |
15 | 415e60425 |
hex | 271457117 |
10490310935 has 64 divisors (see below), whose sum is σ = 14331727872. Its totient is φ = 7320208896.
The previous prime is 10490310907. The next prime is 10490310947. The reversal of 10490310935 is 53901309401.
It is not a de Polignac number, because 10490310935 - 212 = 10490306839 is a prime.
It is a super-2 number, since 2×104903109352 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10490310895 and 10490310904.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 10847822 + ... + 10848788.
It is an arithmetic number, because the mean of its divisors is an integer number (223933248).
Almost surely, 210490310935 is an apocalyptic number.
10490310935 is a deficient number, since it is larger than the sum of its proper divisors (3841416937).
10490310935 is a wasteful number, since it uses less digits than its factorization.
10490310935 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1152.
The product of its (nonzero) digits is 14580, while the sum is 35.
The spelling of 10490310935 in words is "ten billion, four hundred ninety million, three hundred ten thousand, nine hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •