Base | Representation |
---|---|
bin | 10100011110111000… |
… | …10111111110100111 |
3 | 1001101100212211100020 |
4 | 22033130113332213 |
5 | 140010101432402 |
6 | 5015101250223 |
7 | 536334555462 |
oct | 121734277647 |
9 | 31340784306 |
10 | 10996514727 |
11 | 4733278300 |
12 | 216a863973 |
13 | 10632a7163 |
14 | 7646442d9 |
15 | 4456018bc |
hex | 28f717fa7 |
10996514727 has 48 divisors (see below), whose sum is σ = 17549616000. Its totient is φ = 6095960640.
The previous prime is 10996514723. The next prime is 10996514741. The reversal of 10996514727 is 72741569901.
It is not a de Polignac number, because 10996514727 - 22 = 10996514723 is a prime.
It is a super-2 number, since 2×109965147272 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10996514727.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10996514723) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 172524 + ... + 227502.
It is an arithmetic number, because the mean of its divisors is an integer number (365617000).
Almost surely, 210996514727 is an apocalyptic number.
10996514727 is a deficient number, since it is larger than the sum of its proper divisors (6553101273).
10996514727 is a wasteful number, since it uses less digits than its factorization.
10996514727 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55052 (or 55041 counting only the distinct ones).
The product of its (nonzero) digits is 952560, while the sum is 51.
The spelling of 10996514727 in words is "ten billion, nine hundred ninety-six million, five hundred fourteen thousand, seven hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •