Base | Representation |
---|---|
bin | 10100011110111011… |
… | …10011111010011111 |
3 | 1001101101120221220012 |
4 | 22033131303322133 |
5 | 140010201010140 |
6 | 5015113313435 |
7 | 536341014365 |
oct | 121735637237 |
9 | 31341527805 |
10 | 10996891295 |
11 | 4733505215 |
12 | 216aa0587b |
13 | 10633a9690 |
14 | 764701635 |
15 | 445678265 |
hex | 28f773e9f |
10996891295 has 32 divisors (see below), whose sum is σ = 14615318592. Its totient is φ = 7892831232.
The previous prime is 10996891289. The next prime is 10996891319. The reversal of 10996891295 is 59219869901.
It is not a de Polignac number, because 10996891295 - 210 = 10996890271 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 353699 + ... + 383531.
It is an arithmetic number, because the mean of its divisors is an integer number (456728706).
Almost surely, 210996891295 is an apocalyptic number.
10996891295 is a deficient number, since it is larger than the sum of its proper divisors (3618427297).
10996891295 is a wasteful number, since it uses less digits than its factorization.
10996891295 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30011.
The product of its (nonzero) digits is 3149280, while the sum is 59.
The spelling of 10996891295 in words is "ten billion, nine hundred ninety-six million, eight hundred ninety-one thousand, two hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •