Base | Representation |
---|---|
bin | 100001100111101… |
… | …1110100111000011 |
3 | 2220121202222211001 |
4 | 1003033132213003 |
5 | 4302300143021 |
6 | 303535432431 |
7 | 36645645460 |
oct | 10317364703 |
9 | 2817688731 |
10 | 1128131011 |
11 | 529889587 |
12 | 275985717 |
13 | 14c950057 |
14 | a9b82667 |
15 | 69091091 |
hex | 433de9c3 |
1128131011 has 8 divisors (see below), whose sum is σ = 1310429024. Its totient is φ = 951117120.
The previous prime is 1128131003. The next prime is 1128131027. The reversal of 1128131011 is 1101318211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1128131011 - 23 = 1128131003 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1128131011.
It is not an unprimeable number, because it can be changed into a prime (1128131311) 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 in 7 ways as a sum of consecutive naturals, for example, 1320570 + ... + 1321423.
It is an arithmetic number, because the mean of its divisors is an integer number (163803628).
Almost surely, 21128131011 is an apocalyptic number.
1128131011 is a deficient number, since it is larger than the sum of its proper divisors (182298013).
1128131011 is an equidigital number, since it uses as much as digits as its factorization.
1128131011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2642061.
The product of its (nonzero) digits is 48, while the sum is 19.
The square root of 1128131011 is about 33587.6615887442. The cubic root of 1128131011 is about 1041.0058719286.
Adding to 1128131011 its reverse (1101318211), we get a palindrome (2229449222).
The spelling of 1128131011 in words is "one billion, one hundred twenty-eight million, one hundred thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •