Base | Representation |
---|---|
bin | 10100111110000101… |
… | …10001100100011101 |
3 | 1002001121100210220111 |
4 | 22133002301210131 |
5 | 141024102124021 |
6 | 5101051050021 |
7 | 545663311663 |
oct | 123702614435 |
9 | 32047323814 |
10 | 11258239261 |
11 | 4857a89875 |
12 | 2222440911 |
13 | 10a5593349 |
14 | 78b2d2c33 |
15 | 45d59e8e1 |
hex | 29f0b191d |
11258239261 has 2 divisors, whose sum is σ = 11258239262. Its totient is φ = 11258239260.
The previous prime is 11258239247. The next prime is 11258239283. The reversal of 11258239261 is 16293285211.
It is a happy number.
11258239261 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8972825625 + 2285413636 = 94725^2 + 47806^2 .
It is a cyclic number.
It is not a de Polignac number, because 11258239261 - 25 = 11258239229 is a prime.
It is a super-2 number, since 2×112582392612 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11258239061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5629119630 + 5629119631.
It is an arithmetic number, because the mean of its divisors is an integer number (5629119631).
Almost surely, 211258239261 is an apocalyptic number.
It is an amenable number.
11258239261 is a deficient number, since it is larger than the sum of its proper divisors (1).
11258239261 is an equidigital number, since it uses as much as digits as its factorization.
11258239261 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 51840, while the sum is 40.
The spelling of 11258239261 in words is "eleven billion, two hundred fifty-eight million, two hundred thirty-nine thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •