Base | Representation |
---|---|
bin | 100001101000010… |
… | …0000110110011011 |
3 | 2220122021202222221 |
4 | 1003100200312123 |
5 | 4302332333311 |
6 | 303545324511 |
7 | 36651155500 |
oct | 10320406633 |
9 | 2818252887 |
10 | 1128402331 |
11 | 529a54411 |
12 | 275a96737 |
13 | 14ca166b4 |
14 | a9c134a7 |
15 | 690e6671 |
hex | 43420d9b |
1128402331 has 6 divisors (see below), whose sum is σ = 1312631340. Its totient is φ = 967201956.
The previous prime is 1128402307. The next prime is 1128402337. The reversal of 1128402331 is 1332048211.
It is a happy number.
It is not a de Polignac number, because 1128402331 - 25 = 1128402299 is a prime.
It is a super-2 number, since 2×11284023312 = 2546583641212467122, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1128402296 and 1128402305.
It is not an unprimeable number, because it can be changed into a prime (1128402337) 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 in 5 ways as a sum of consecutive naturals, for example, 11514261 + ... + 11514358.
It is an arithmetic number, because the mean of its divisors is an integer number (218771890).
Almost surely, 21128402331 is an apocalyptic number.
1128402331 is a deficient number, since it is larger than the sum of its proper divisors (184229009).
1128402331 is an equidigital number, since it uses as much as digits as its factorization.
1128402331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23028633 (or 23028626 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 25.
The square root of 1128402331 is about 33591.7003290992. The cubic root of 1128402331 is about 1041.0893205914.
The spelling of 1128402331 in words is "one billion, one hundred twenty-eight million, four hundred two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •