Base | Representation |
---|---|
bin | 1000011010001000… |
… | …00011000001000001 |
3 | 102122121010200000022 |
4 | 10031010003001001 |
5 | 33221104211113 |
6 | 2023533303225 |
7 | 216602326535 |
oct | 41504030101 |
9 | 12577120008 |
10 | 4514132033 |
11 | 1a07123234 |
12 | a5b934b15 |
13 | 56c2b4058 |
14 | 30b747bc5 |
15 | 1b6480908 |
hex | 10d103041 |
4514132033 has 2 divisors, whose sum is σ = 4514132034. Its totient is φ = 4514132032.
The previous prime is 4514132003. The next prime is 4514132041. The reversal of 4514132033 is 3302314154.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3071043889 + 1443088144 = 55417^2 + 37988^2 .
It is a cyclic number.
It is not a de Polignac number, because 4514132033 - 216 = 4514066497 is a prime.
It is a super-2 number, since 2×45141320332 = 40754776022713426178, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4514131993 and 4514132011.
It is not a weakly prime, because it can be changed into another prime (4514132003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2257066016 + 2257066017.
It is an arithmetic number, because the mean of its divisors is an integer number (2257066017).
Almost surely, 24514132033 is an apocalyptic number.
It is an amenable number.
4514132033 is a deficient number, since it is larger than the sum of its proper divisors (1).
4514132033 is an equidigital number, since it uses as much as digits as its factorization.
4514132033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 26.
The square root of 4514132033 is about 67187.2907103717. The cubic root of 4514132033 is about 1652.6900756442.
Adding to 4514132033 its reverse (3302314154), we get a palindrome (7816446187).
The spelling of 4514132033 in words is "four billion, five hundred fourteen million, one hundred thirty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •