Base | Representation |
---|---|
bin | 100000110100110… |
… | …0010000000111111 |
3 | 2211202111020100212 |
4 | 1001221202000333 |
5 | 4223430000041 |
6 | 301142543035 |
7 | 36202541000 |
oct | 10151420077 |
9 | 2752436325 |
10 | 1101406271 |
11 | 515795919 |
12 | 268a37a7b |
13 | 147253ab4 |
14 | a63c71a7 |
15 | 66a628eb |
hex | 41a6203f |
1101406271 has 16 divisors (see below), whose sum is σ = 1286150400. Its totient is φ = 942805080.
The previous prime is 1101406259. The next prime is 1101406289. The reversal of 1101406271 is 1726041011.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-1101406271 is a prime.
It is a super-3 number, since 3×11014062713 (a number of 28 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101406291) 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 15 ways as a sum of consecutive naturals, for example, 331400 + ... + 334706.
It is an arithmetic number, because the mean of its divisors is an integer number (80384400).
Almost surely, 21101406271 is an apocalyptic number.
1101406271 is a deficient number, since it is larger than the sum of its proper divisors (184744129).
1101406271 is an frugal number, since it uses more digits than its factorization.
1101406271 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4299 (or 4285 counting only the distinct ones).
The product of its (nonzero) digits is 336, while the sum is 23.
The square root of 1101406271 is about 33187.4414651085. The cubic root of 1101406271 is about 1032.7198267935.
Adding to 1101406271 its reverse (1726041011), we get a palindrome (2827447282).
The spelling of 1101406271 in words is "one billion, one hundred one million, four hundred six thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •