Base | Representation |
---|---|
bin | 1101001001000110110100… |
… | …1010110101110010010001 |
3 | 1220011102020102101100212020 |
4 | 3102101231022311302101 |
5 | 3343222301443321113 |
6 | 50422141321122053 |
7 | 3020661662341203 |
oct | 322215512656221 |
9 | 56142212340766 |
10 | 14450101542033 |
11 | 4671287675073 |
12 | 1754639929329 |
13 | 80a83c395641 |
14 | 37d562634773 |
15 | 1a0d31048023 |
hex | d246d2b5c91 |
14450101542033 has 32 divisors (see below), whose sum is σ = 20317884840960. Its totient is φ = 9109725704640.
The previous prime is 14450101542007. The next prime is 14450101542059. The reversal of 14450101542033 is 33024510105441.
It is an interprime number because it is at equal distance from previous prime (14450101542007) and next prime (14450101542059).
It is not a de Polignac number, because 14450101542033 - 210 = 14450101541009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14450101541985 and 14450101542003.
It is not an unprimeable number, because it can be changed into a prime (14450101542533) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 74925898 + ... + 75118508.
It is an arithmetic number, because the mean of its divisors is an integer number (634933901280).
Almost surely, 214450101542033 is an apocalyptic number.
It is an amenable number.
14450101542033 is a deficient number, since it is larger than the sum of its proper divisors (5867783298927).
14450101542033 is a wasteful number, since it uses less digits than its factorization.
14450101542033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195029.
The product of its (nonzero) digits is 28800, while the sum is 33.
Adding to 14450101542033 its reverse (33024510105441), we get a palindrome (47474611647474).
The spelling of 14450101542033 in words is "fourteen trillion, four hundred fifty billion, one hundred one million, five hundred forty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •