Base | Representation |
---|---|
bin | 10100100100111011… |
… | …10101110001100111 |
3 | 1001111220022110101200 |
4 | 22102131311301213 |
5 | 140111042334232 |
6 | 5024112253543 |
7 | 540521624202 |
oct | 122235656147 |
9 | 31456273350 |
10 | 11047230567 |
11 | 475996791a |
12 | 21838412b3 |
13 | 1070953329 |
14 | 76b286939 |
15 | 449cbd77c |
hex | 292775c67 |
11047230567 has 6 divisors (see below), whose sum is σ = 15957110832. Its totient is φ = 7364820372.
The previous prime is 11047230541. The next prime is 11047230569. The reversal of 11047230567 is 76503274011.
It is a happy number.
It is not a de Polignac number, because 11047230567 - 211 = 11047228519 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11047230569) 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 5 ways as a sum of consecutive naturals, for example, 613735023 + ... + 613735040.
It is an arithmetic number, because the mean of its divisors is an integer number (2659518472).
Almost surely, 211047230567 is an apocalyptic number.
11047230567 is a deficient number, since it is larger than the sum of its proper divisors (4909880265).
11047230567 is a wasteful number, since it uses less digits than its factorization.
11047230567 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1227470069 (or 1227470066 counting only the distinct ones).
The product of its (nonzero) digits is 35280, while the sum is 36.
The spelling of 11047230567 in words is "eleven billion, forty-seven million, two hundred thirty thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •