Base | Representation |
---|---|
bin | 100001101101010… |
… | …0010010010110001 |
3 | 2220211020021001012 |
4 | 1003122202102301 |
5 | 4304020422211 |
6 | 304121520305 |
7 | 40012410425 |
oct | 10332422261 |
9 | 2824207035 |
10 | 1131029681 |
11 | 530489381 |
12 | 276943095 |
13 | 150426542 |
14 | aa2d8b85 |
15 | 69464d8b |
hex | 436a24b1 |
1131029681 has 2 divisors, whose sum is σ = 1131029682. Its totient is φ = 1131029680.
The previous prime is 1131029657. The next prime is 1131029687. The reversal of 1131029681 is 1869201311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 613057600 + 517972081 = 24760^2 + 22759^2 .
It is an emirp because it is prime and its reverse (1869201311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1131029681 - 214 = 1131013297 is a prime.
It is a super-2 number, since 2×11310296812 = 2558456278605923522, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1131029687) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 565514840 + 565514841.
It is an arithmetic number, because the mean of its divisors is an integer number (565514841).
Almost surely, 21131029681 is an apocalyptic number.
It is an amenable number.
1131029681 is a deficient number, since it is larger than the sum of its proper divisors (1).
1131029681 is an equidigital number, since it uses as much as digits as its factorization.
1131029681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 32.
The square root of 1131029681 is about 33630.7847217397. The cubic root of 1131029681 is about 1041.8967116400.
The spelling of 1131029681 in words is "one billion, one hundred thirty-one million, twenty-nine thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •