Base | Representation |
---|---|
bin | 10011100011010101… |
… | …11001011010101110 |
3 | 1000002112222010010111 |
4 | 21301222321122232 |
5 | 132444213131410 |
6 | 4453335130234 |
7 | 521061033535 |
oct | 116152713256 |
9 | 30075863114 |
10 | 10497005230 |
11 | 44a7316438 |
12 | 204b51397a |
13 | cb39643ca |
14 | 71817931c |
15 | 416833b8a |
hex | 271ab96ae |
10497005230 has 16 divisors (see below), whose sum is σ = 18989560800. Its totient is φ = 4177701792.
The previous prime is 10497005219. The next prime is 10497005261. The reversal of 10497005230 is 3250079401.
It is a super-2 number, since 2×104970052302 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10497005192 and 10497005201.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2635449 + ... + 2639428.
It is an arithmetic number, because the mean of its divisors is an integer number (1186847550).
Almost surely, 210497005230 is an apocalyptic number.
10497005230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10497005230 is a deficient number, since it is larger than the sum of its proper divisors (8492555570).
10497005230 is a wasteful number, since it uses less digits than its factorization.
10497005230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5275083.
The product of its (nonzero) digits is 7560, while the sum is 31.
The spelling of 10497005230 in words is "ten billion, four hundred ninety-seven million, five thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •