Base | Representation |
---|---|
bin | 11101010011101110010… |
… | …100011010011010111001 |
3 | 21010112121010021100001021 |
4 | 131103232110122122321 |
5 | 230444230003214113 |
6 | 4141123311422441 |
7 | 265336602142126 |
oct | 35235624323271 |
9 | 7115533240037 |
10 | 2014043023033 |
11 | 707172864948 |
12 | 286402b24a21 |
13 | 117c00a57a62 |
14 | 6d6a196574d |
15 | 375cacad48d |
hex | 1d4ee51a6b9 |
2014043023033 has 2 divisors, whose sum is σ = 2014043023034. Its totient is φ = 2014043023032.
The previous prime is 2014043023007. The next prime is 2014043023127. The reversal of 2014043023033 is 3303203404102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1481096302009 + 532946721024 = 1217003^2 + 730032^2 .
It is a cyclic number.
It is not a de Polignac number, because 2014043023033 - 29 = 2014043022521 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2014043022989 and 2014043023007.
It is not a weakly prime, because it can be changed into another prime (2014043023133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1007021511516 + 1007021511517.
It is an arithmetic number, because the mean of its divisors is an integer number (1007021511517).
Almost surely, 22014043023033 is an apocalyptic number.
It is an amenable number.
2014043023033 is a deficient number, since it is larger than the sum of its proper divisors (1).
2014043023033 is an equidigital number, since it uses as much as digits as its factorization.
2014043023033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 25.
Adding to 2014043023033 its reverse (3303203404102), we get a palindrome (5317246427135).
The spelling of 2014043023033 in words is "two trillion, fourteen billion, forty-three million, twenty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •