Base | Representation |
---|---|
bin | 1101000010000111100011… |
… | …1101111100000010111011 |
3 | 1212201221100011011112011002 |
4 | 3100201320331330002323 |
5 | 3334240410320331412 |
6 | 50251044002155215 |
7 | 3006211521443243 |
oct | 320417075740273 |
9 | 55657304145132 |
10 | 14330040402107 |
11 | 4625377250691 |
12 | 1735311652b0b |
13 | 7cc417622501 |
14 | 377813134b23 |
15 | 19cb55a16dc2 |
hex | d0878f7c0bb |
14330040402107 has 2 divisors, whose sum is σ = 14330040402108. Its totient is φ = 14330040402106.
The previous prime is 14330040402103. The next prime is 14330040402187. The reversal of 14330040402107 is 70120404003341.
It is a weak prime.
It is an emirp because it is prime and its reverse (70120404003341) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14330040402107 - 22 = 14330040402103 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14330040402107.
It is not a weakly prime, because it can be changed into another prime (14330040402103) 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, 7165020201053 + 7165020201054.
It is an arithmetic number, because the mean of its divisors is an integer number (7165020201054).
Almost surely, 214330040402107 is an apocalyptic number.
14330040402107 is a deficient number, since it is larger than the sum of its proper divisors (1).
14330040402107 is an equidigital number, since it uses as much as digits as its factorization.
14330040402107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 29.
Adding to 14330040402107 its reverse (70120404003341), we get a palindrome (84450444405448).
The spelling of 14330040402107 in words is "fourteen trillion, three hundred thirty billion, forty million, four hundred two thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •