Base | Representation |
---|---|
bin | 10100011110101101… |
… | …10011111100011101 |
3 | 1001101021010201220121 |
4 | 22033112303330131 |
5 | 140004213301123 |
6 | 5015010114541 |
7 | 536316303025 |
oct | 121726637435 |
9 | 31337121817 |
10 | 10995056413 |
11 | 4732471690 |
12 | 216a27ba51 |
13 | 1062bb6453 |
14 | 764384a85 |
15 | 44541475d |
hex | 28f5b3f1d |
10995056413 has 16 divisors (see below), whose sum is σ = 12523968000. Its totient is φ = 9554917680.
The previous prime is 10995056407. The next prime is 10995056417. The reversal of 10995056413 is 31465059901.
It is not a de Polignac number, because 10995056413 - 25 = 10995056381 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10995056413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10995056417) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 417058 + ... + 442636.
It is an arithmetic number, because the mean of its divisors is an integer number (782748000).
Almost surely, 210995056413 is an apocalyptic number.
It is an amenable number.
10995056413 is a deficient number, since it is larger than the sum of its proper divisors (1528911587).
10995056413 is a wasteful number, since it uses less digits than its factorization.
10995056413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27312.
The product of its (nonzero) digits is 145800, while the sum is 43.
The spelling of 10995056413 in words is "ten billion, nine hundred ninety-five million, fifty-six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •