Base | Representation |
---|---|
bin | 1000000000111010… |
… | …0110111010001001 |
3 | 12112221002000200111 |
4 | 2000032212322021 |
5 | 13401214004113 |
6 | 553250034321 |
7 | 104211600442 |
oct | 20016467211 |
9 | 5487060614 |
10 | 2151313033 |
11 | a043a6361 |
12 | 5005789a1 |
13 | 283915abc |
14 | 165a062c9 |
15 | c8d0113d |
hex | 803a6e89 |
2151313033 has 2 divisors, whose sum is σ = 2151313034. Its totient is φ = 2151313032.
The previous prime is 2151312973. The next prime is 2151313037. The reversal of 2151313033 is 3303131512.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1699665529 + 451647504 = 41227^2 + 21252^2 .
It is a cyclic number.
It is not a de Polignac number, because 2151313033 - 221 = 2149215881 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2151312995 and 2151313013.
It is not a weakly prime, because it can be changed into another prime (2151313037) 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, 1075656516 + 1075656517.
It is an arithmetic number, because the mean of its divisors is an integer number (1075656517).
Almost surely, 22151313033 is an apocalyptic number.
It is an amenable number.
2151313033 is a deficient number, since it is larger than the sum of its proper divisors (1).
2151313033 is an equidigital number, since it uses as much as digits as its factorization.
2151313033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 810, while the sum is 22.
The square root of 2151313033 is about 46382.2491153674. The cubic root of 2151313033 is about 1290.9255687489.
Adding to 2151313033 its reverse (3303131512), we get a palindrome (5454444545).
The spelling of 2151313033 in words is "two billion, one hundred fifty-one million, three hundred thirteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •