Base | Representation |
---|---|
bin | 100000110100100… |
… | …1010110011111111 |
3 | 2211202022101222212 |
4 | 1001221022303333 |
5 | 4223413424411 |
6 | 301140531035 |
7 | 36201663626 |
oct | 10151126377 |
9 | 2752271885 |
10 | 1101311231 |
11 | 515730479 |
12 | 2689b0a7b |
13 | 14721c767 |
14 | a63a06bd |
15 | 66a4468b |
hex | 41a4acff |
1101311231 has 16 divisors (see below), whose sum is σ = 1213766400. Its totient is φ = 994612608.
The previous prime is 1101311207. The next prime is 1101311249. The reversal of 1101311231 is 1321131011.
It is a happy number.
It is not a de Polignac number, because 1101311231 - 210 = 1101310207 is a prime.
It is a super-3 number, since 3×11013112313 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101311201) 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 15 ways as a sum of consecutive naturals, for example, 130055 + ... + 138263.
It is an arithmetic number, because the mean of its divisors is an integer number (75860400).
Almost surely, 21101311231 is an apocalyptic number.
1101311231 is a deficient number, since it is larger than the sum of its proper divisors (112455169).
1101311231 is a wasteful number, since it uses less digits than its factorization.
1101311231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8558.
The product of its (nonzero) digits is 18, while the sum is 14.
The square root of 1101311231 is about 33186.0095672860. The cubic root of 1101311231 is about 1032.6901215829.
Adding to 1101311231 its reverse (1321131011), we get a palindrome (2422442242).
The spelling of 1101311231 in words is "one billion, one hundred one million, three hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •