Base | Representation |
---|---|
bin | 11010000101100100… |
… | …01000011101110111 |
3 | 1100011001111222201011 |
4 | 31002302020131313 |
5 | 212140331340043 |
6 | 10233423013051 |
7 | 1004031266053 |
oct | 150262103567 |
9 | 40131458634 |
10 | 14005340023 |
11 | 5a37716284 |
12 | 286a43a187 |
13 | 142275b65c |
14 | 96c0a6c63 |
15 | 56e83a59d |
hex | 342c88777 |
14005340023 has 2 divisors, whose sum is σ = 14005340024. Its totient is φ = 14005340022.
The previous prime is 14005340003. The next prime is 14005340039. The reversal of 14005340023 is 32004350041.
14005340023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 14005340023 - 29 = 14005339511 is a prime.
It is a super-2 number, since 2×140053400232 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14005339976 and 14005340003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14005340003) 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, 7002670011 + 7002670012.
It is an arithmetic number, because the mean of its divisors is an integer number (7002670012).
Almost surely, 214005340023 is an apocalyptic number.
14005340023 is a deficient number, since it is larger than the sum of its proper divisors (1).
14005340023 is an equidigital number, since it uses as much as digits as its factorization.
14005340023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 22.
Adding to 14005340023 its reverse (32004350041), we get a palindrome (46009690064).
The spelling of 14005340023 in words is "fourteen billion, five million, three hundred forty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •