Base | Representation |
---|---|
bin | 10011110111000011… |
… | …00111011010101100 |
3 | 1000112002002012210010 |
4 | 21323201213122230 |
5 | 133314030004424 |
6 | 4522003013220 |
7 | 525136301040 |
oct | 117341473254 |
9 | 30462065703 |
10 | 10662344364 |
11 | 4581685151 |
12 | 209696a210 |
13 | 100bca4109 |
14 | 7320d8020 |
15 | 4260e3229 |
hex | 27b8676ac |
10662344364 has 48 divisors (see below), whose sum is σ = 28439341056. Its totient is φ = 3045696000.
The previous prime is 10662344333. The next prime is 10662344369. The reversal of 10662344364 is 46344326601.
It is a super-2 number, since 2×106623443642 (a number of 21 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (10662344369) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 447964 + ... + 471164.
It is an arithmetic number, because the mean of its divisors is an integer number (592486272).
Almost surely, 210662344364 is an apocalyptic number.
10662344364 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
10662344364 is an abundant number, since it is smaller than the sum of its proper divisors (17776996692).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10662344364 is a wasteful number, since it uses less digits than its factorization.
10662344364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28686 (or 28684 counting only the distinct ones).
The product of its (nonzero) digits is 248832, while the sum is 39.
The spelling of 10662344364 in words is "ten billion, six hundred sixty-two million, three hundred forty-four thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •