Base | Representation |
---|---|
bin | 11101010100000110001… |
… | …010010010000010001111 |
3 | 21010120121222221022022201 |
4 | 131110012022102002033 |
5 | 231001034403123211 |
6 | 4141231121022331 |
7 | 265352530103242 |
oct | 35240612220217 |
9 | 7116558838281 |
10 | 2014443020431 |
11 | 707358628906 |
12 | 2864b4a849a7 |
13 | 117c658980ca |
14 | 6d6dcb29259 |
15 | 37600e710c1 |
hex | 1d50629208f |
2014443020431 has 2 divisors, whose sum is σ = 2014443020432. Its totient is φ = 2014443020430.
The previous prime is 2014443020423. The next prime is 2014443020497. The reversal of 2014443020431 is 1340203444102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2014443020431 - 23 = 2014443020423 is a prime.
It is a super-2 number, since 2×20144430204312 (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 2014443020431.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2014443027431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1007221510215 + 1007221510216.
It is an arithmetic number, because the mean of its divisors is an integer number (1007221510216).
Almost surely, 22014443020431 is an apocalyptic number.
2014443020431 is a deficient number, since it is larger than the sum of its proper divisors (1).
2014443020431 is an equidigital number, since it uses as much as digits as its factorization.
2014443020431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9216, while the sum is 28.
Adding to 2014443020431 its reverse (1340203444102), we get a palindrome (3354646464533).
The spelling of 2014443020431 in words is "two trillion, fourteen billion, four hundred forty-three million, twenty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •