Base | Representation |
---|---|
bin | 100010010100000… |
… | …0111001111110011 |
3 | 2222020111110102001 |
4 | 1010220013033303 |
5 | 4324222204011 |
6 | 310125434431 |
7 | 40350310366 |
oct | 10450071763 |
9 | 2866443361 |
10 | 1151366131 |
11 | 540a09463 |
12 | 28170ba17 |
13 | 1546c6b46 |
14 | accb00dd |
15 | 6b1307c1 |
hex | 44a073f3 |
1151366131 has 8 divisors (see below), whose sum is σ = 1201879584. Its totient is φ = 1100890560.
The previous prime is 1151366129. The next prime is 1151366143. The reversal of 1151366131 is 1316631511.
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 1151366131 - 21 = 1151366129 is a prime.
It is a super-2 number, since 2×11513661312 = 2651287935227818322, which contains 22 as substring.
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 1151366131.
It is not an unprimeable number, because it can be changed into a prime (1151366101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65295 + ... + 81031.
It is an arithmetic number, because the mean of its divisors is an integer number (150234948).
Almost surely, 21151366131 is an apocalyptic number.
1151366131 is a deficient number, since it is larger than the sum of its proper divisors (50513453).
1151366131 is a wasteful number, since it uses less digits than its factorization.
1151366131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18941.
The product of its digits is 1620, while the sum is 28.
The square root of 1151366131 is about 33931.7864398561. The cubic root of 1151366131 is about 1048.1042531114.
Adding to 1151366131 its reverse (1316631511), we get a palindrome (2467997642).
The spelling of 1151366131 in words is "one billion, one hundred fifty-one million, three hundred sixty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •