Base | Representation |
---|---|
bin | 100001110001000… |
… | …0110010101001011 |
3 | 2220221221222200111 |
4 | 1003202012111023 |
5 | 4310022343144 |
6 | 304232215151 |
7 | 40035305566 |
oct | 10342062513 |
9 | 2827858614 |
10 | 1133012299 |
11 | 531612a01 |
12 | 27753a4b7 |
13 | 15096baa3 |
14 | aa6934dd |
15 | 69707534 |
hex | 4388654b |
1133012299 has 2 divisors, whose sum is σ = 1133012300. Its totient is φ = 1133012298.
The previous prime is 1133012297. The next prime is 1133012303. The reversal of 1133012299 is 9922103311.
It is a weak prime.
It is an emirp because it is prime and its reverse (9922103311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1133012299 - 21 = 1133012297 is a prime.
Together with 1133012297, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1133012299.
It is not a weakly prime, because it can be changed into another prime (1133012297) 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 as a sum of consecutive naturals, namely, 566506149 + 566506150.
It is an arithmetic number, because the mean of its divisors is an integer number (566506150).
Almost surely, 21133012299 is an apocalyptic number.
1133012299 is a deficient number, since it is larger than the sum of its proper divisors (1).
1133012299 is an equidigital number, since it uses as much as digits as its factorization.
1133012299 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 31.
The square root of 1133012299 is about 33660.2480531561. The cubic root of 1133012299 is about 1042.5051475879.
It can be divided in two parts, 1133012 and 299, that added together give a palindrome (1133311).
The spelling of 1133012299 in words is "one billion, one hundred thirty-three million, twelve thousand, two hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •