Base | Representation |
---|---|
bin | 1101000000011000000011… |
… | …1110101001000010000111 |
3 | 1212122002002020220020110002 |
4 | 3100012000332221002013 |
5 | 3333243111132024111 |
6 | 50225214014351515 |
7 | 3004102025503064 |
oct | 320060076510207 |
9 | 55562066806402 |
10 | 14300110033031 |
11 | 4613708346379 |
12 | 172b559abb59b |
13 | 7c96577c9c54 |
14 | 3761b4053c6b |
15 | 19bea309463b |
hex | d0180fa9087 |
14300110033031 has 2 divisors, whose sum is σ = 14300110033032. Its totient is φ = 14300110033030.
The previous prime is 14300110033009. The next prime is 14300110033043. The reversal of 14300110033031 is 13033001100341.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14300110033031 is a prime.
It is a super-2 number, since 2×143001100330312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14300110032994 and 14300110033012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14300110533031) 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, 7150055016515 + 7150055016516.
It is an arithmetic number, because the mean of its divisors is an integer number (7150055016516).
Almost surely, 214300110033031 is an apocalyptic number.
14300110033031 is a deficient number, since it is larger than the sum of its proper divisors (1).
14300110033031 is an equidigital number, since it uses as much as digits as its factorization.
14300110033031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 14300110033031 its reverse (13033001100341), we get a palindrome (27333111133372).
The spelling of 14300110033031 in words is "fourteen trillion, three hundred billion, one hundred ten million, thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •