Base | Representation |
---|---|
bin | 1101000111100111111000… |
… | …0111011101000011101100 |
3 | 1220001222110021221220022020 |
4 | 3101321332013131003230 |
5 | 3342313103203010322 |
6 | 50402324354550140 |
7 | 3016100301342525 |
oct | 321717607350354 |
9 | 56058407856266 |
10 | 14424616063212 |
11 | 466149979a683 |
12 | 174b706898350 |
13 | 80830a3bc764 |
14 | 37c2259d584c |
15 | 1a033d92a05c |
hex | d1e7e1dd0ec |
14424616063212 has 24 divisors (see below), whose sum is σ = 33663533892912. Its totient is φ = 4807334438400.
The previous prime is 14424616063211. The next prime is 14424616063213. The reversal of 14424616063212 is 21236061642441.
It is an interprime number because it is at equal distance from previous prime (14424616063211) and next prime (14424616063213).
It is not an unprimeable number, because it can be changed into a prime (14424616063211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 108795489 + ... + 108927992.
It is an arithmetic number, because the mean of its divisors is an integer number (1402647245538).
Almost surely, 214424616063212 is an apocalyptic number.
14424616063212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14424616063212 is an abundant number, since it is smaller than the sum of its proper divisors (19238917829700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14424616063212 is a wasteful number, since it uses less digits than its factorization.
14424616063212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217729009 (or 217729007 counting only the distinct ones).
The product of its (nonzero) digits is 331776, while the sum is 42.
The spelling of 14424616063212 in words is "fourteen trillion, four hundred twenty-four billion, six hundred sixteen million, sixty-three thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •