Base | Representation |
---|---|
bin | 10011010111101100… |
… | …10101011111010000 |
3 | 222211202012020022010 |
4 | 21223312111133100 |
5 | 132244212343441 |
6 | 4435525542520 |
7 | 515463635646 |
oct | 115366253720 |
9 | 28752166263 |
10 | 10399340496 |
11 | 445717a486 |
12 | 2022874a40 |
13 | c9965a81c |
14 | 7091d5196 |
15 | 40ce91116 |
hex | 26bd957d0 |
10399340496 has 20 divisors (see below), whose sum is σ = 26864963072. Its totient is φ = 3466446816.
The previous prime is 10399340489. The next prime is 10399340503. The reversal of 10399340496 is 69404399301.
It is an interprime number because it is at equal distance from previous prime (10399340489) and next prime (10399340503).
It is a Harshad number since it is a multiple of its sum of digits (48), and also a Moran number because the ratio is a prime number: 216652927 = 10399340496 / (1 + 0 + 3 + 9 + 9 + 3 + 4 + 0 + 4 + 9 + 6).
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 3 ways as a sum of consecutive naturals, for example, 108326416 + ... + 108326511.
Almost surely, 210399340496 is an apocalyptic number.
10399340496 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
10399340496 is an abundant number, since it is smaller than the sum of its proper divisors (16465622576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10399340496 is a wasteful number, since it uses less digits than its factorization.
10399340496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216652938 (or 216652932 counting only the distinct ones).
The product of its (nonzero) digits is 629856, while the sum is 48.
The spelling of 10399340496 in words is "ten billion, three hundred ninety-nine million, three hundred forty thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •