Base | Representation |
---|---|
bin | 11101010011110011101… |
… | …100110011110000001011 |
3 | 21010112211102011002201001 |
4 | 131103303230303300023 |
5 | 230444421111214311 |
6 | 4141140254435431 |
7 | 265342046415661 |
oct | 35236354636013 |
9 | 7115742132631 |
10 | 2014133304331 |
11 | 707209818595 |
12 | 286429202b77 |
13 | 117c16677a45 |
14 | 6d6ad946c31 |
15 | 375d3b934c1 |
hex | 1d4f3b33c0b |
2014133304331 has 2 divisors, whose sum is σ = 2014133304332. Its totient is φ = 2014133304330.
The previous prime is 2014133304307. The next prime is 2014133304343. The reversal of 2014133304331 is 1334033314102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2014133304331 - 237 = 1876694350859 is a prime.
It is a super-2 number, since 2×20141333043312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2014133304331.
It is not a weakly prime, because it can be changed into another prime (2014133301331) 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, 1007066652165 + 1007066652166.
It is an arithmetic number, because the mean of its divisors is an integer number (1007066652166).
Almost surely, 22014133304331 is an apocalyptic number.
2014133304331 is a deficient number, since it is larger than the sum of its proper divisors (1).
2014133304331 is an equidigital number, since it uses as much as digits as its factorization.
2014133304331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 2014133304331 its reverse (1334033314102), we get a palindrome (3348166618433).
The spelling of 2014133304331 in words is "two trillion, fourteen billion, one hundred thirty-three million, three hundred four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •