Base | Representation |
---|---|
bin | 1101000111000001111110… |
… | …0100111101111101010001 |
3 | 1220001000012002221212001111 |
4 | 3101300133210331331101 |
5 | 3342131233121430113 |
6 | 50353522523133321 |
7 | 3015260155443361 |
oct | 321603744757521 |
9 | 56030162855044 |
10 | 14414440030033 |
11 | 46581476822aa |
12 | 1749746974241 |
13 | 8073780b9b54 |
14 | 37b93c32c9a1 |
15 | 19ee4539913d |
hex | d1c1f93df51 |
14414440030033 has 2 divisors, whose sum is σ = 14414440030034. Its totient is φ = 14414440030032.
The previous prime is 14414440030021. The next prime is 14414440030051. The reversal of 14414440030033 is 33003004441441.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10740977139649 + 3673462890384 = 3277343^2 + 1916628^2 .
It is a cyclic number.
It is not a de Polignac number, because 14414440030033 - 213 = 14414440021841 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14414440029977 and 14414440030004.
It is not a weakly prime, because it can be changed into another prime (14414440030013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7207220015016 + 7207220015017.
It is an arithmetic number, because the mean of its divisors is an integer number (7207220015017).
Almost surely, 214414440030033 is an apocalyptic number.
It is an amenable number.
14414440030033 is a deficient number, since it is larger than the sum of its proper divisors (1).
14414440030033 is an equidigital number, since it uses as much as digits as its factorization.
14414440030033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 14414440030033 its reverse (33003004441441), we get a palindrome (47417444471474).
The spelling of 14414440030033 in words is "fourteen trillion, four hundred fourteen billion, four hundred forty million, thirty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •