Base | Representation |
---|---|
bin | 100111010101111… |
… | …1110100001011101 |
3 | 10102000002121220102 |
4 | 1032223332201131 |
5 | 10200424314013 |
6 | 334555230445 |
7 | 44500046060 |
oct | 11653764135 |
9 | 3360077812 |
10 | 1320151133 |
11 | 6182110a4 |
12 | 30a148425 |
13 | 180672122 |
14 | c74888d7 |
15 | 7ad70d58 |
hex | 4eafe85d |
1320151133 has 24 divisors (see below), whose sum is σ = 1606990272. Its totient is φ = 1062157824.
The previous prime is 1320151123. The next prime is 1320151139. The reversal of 1320151133 is 3311510231.
It is not a de Polignac number, because 1320151133 - 26 = 1320151069 is a prime.
It is a super-2 number, since 2×13201511332 = 3485598027922367378, which contains 22 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 (1320151139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1105985 + ... + 1107177.
It is an arithmetic number, because the mean of its divisors is an integer number (66957928).
Almost surely, 21320151133 is an apocalyptic number.
It is an amenable number.
1320151133 is a deficient number, since it is larger than the sum of its proper divisors (286839139).
1320151133 is a wasteful number, since it uses less digits than its factorization.
1320151133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1781 (or 1764 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 20.
The square root of 1320151133 is about 36333.8840890979. The cubic root of 1320151133 is about 1097.0031743064.
Adding to 1320151133 its reverse (3311510231), we get a palindrome (4631661364).
The spelling of 1320151133 in words is "one billion, three hundred twenty million, one hundred fifty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •