Base | Representation |
---|---|
bin | 1100111011111100111001… |
… | …1011011000100011101110 |
3 | 1212100210212222121120221201 |
4 | 3032333032123120203232 |
5 | 3331021424100031110 |
6 | 50130243351520114 |
7 | 2665441313056132 |
oct | 316771633304356 |
9 | 55323788546851 |
10 | 14224100002030 |
11 | 45944526a2036 |
12 | 171888638903a |
13 | 7c24331b3b49 |
14 | 37264317b3c2 |
15 | 19a005018b3a |
hex | cefce6d88ee |
14224100002030 has 64 divisors (see below), whose sum is σ = 26409557157120. Its totient is φ = 5511832510464.
The previous prime is 14224100002027. The next prime is 14224100002033. The reversal of 14224100002030 is 3020000142241.
It is an interprime number because it is at equal distance from previous prime (14224100002027) and next prime (14224100002033).
It is a junction number, because it is equal to n+sod(n) for n = 14224100001989 and 14224100002007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14224100002033) 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, 1056997062 + ... + 1057010518.
It is an arithmetic number, because the mean of its divisors is an integer number (412649330580).
Almost surely, 214224100002030 is an apocalyptic number.
14224100002030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14224100002030 is a deficient number, since it is larger than the sum of its proper divisors (12185457155090).
14224100002030 is a wasteful number, since it uses less digits than its factorization.
14224100002030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25693.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 14224100002030 its reverse (3020000142241), we get a palindrome (17244100144271).
The spelling of 14224100002030 in words is "fourteen trillion, two hundred twenty-four billion, one hundred million, two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •