Base | Representation |
---|---|
bin | 100001110001010… |
… | …0011011001000011 |
3 | 2220222012000222002 |
4 | 1003202203121003 |
5 | 4310040200311 |
6 | 304234534215 |
7 | 40036312613 |
oct | 10342433103 |
9 | 2828160862 |
10 | 1133131331 |
11 | 531694382 |
12 | 27759736b |
13 | 1509b1017 |
14 | aa6c4a43 |
15 | 6972c93b |
hex | 438a3643 |
1133131331 has 8 divisors (see below), whose sum is σ = 1156271904. Its totient is φ = 1110196800.
The previous prime is 1133131301. The next prime is 1133131333. The reversal of 1133131331 is 1331313311.
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 1133131331 - 210 = 1133130307 is a prime.
It is a super-2 number, since 2×11331313312 = 2567973226587663122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1133131333) 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 7 ways as a sum of consecutive naturals, for example, 40376 + ... + 62421.
It is an arithmetic number, because the mean of its divisors is an integer number (144533988).
Almost surely, 21133131331 is an apocalyptic number.
1133131331 is a deficient number, since it is larger than the sum of its proper divisors (23140573).
1133131331 is a wasteful number, since it uses less digits than its factorization.
1133131331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103021.
The product of its digits is 243, while the sum is 20.
The square root of 1133131331 is about 33662.0161457985. The cubic root of 1133131331 is about 1042.5416541429.
Adding to 1133131331 its reverse (1331313311), we get a palindrome (2464444642).
The spelling of 1133131331 in words is "one billion, one hundred thirty-three million, one hundred thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •