Base | Representation |
---|---|
bin | 1100111100111011111100… |
… | …0001011111001000000010 |
3 | 1212102102120021020220020202 |
4 | 3033032333001133020002 |
5 | 3331311102441033010 |
6 | 50142122424405202 |
7 | 2666610533556224 |
oct | 317167701371002 |
9 | 55372507226222 |
10 | 14241021424130 |
11 | 45a06463709a6 |
12 | 1720009316802 |
13 | 7c3bcbb24247 |
14 | 3733aa644414 |
15 | 19a69586d6a5 |
hex | cf3bf05f202 |
14241021424130 has 64 divisors (see below), whose sum is σ = 26069453932032. Its totient is φ = 5600650467840.
The previous prime is 14241021424111. The next prime is 14241021424139. The reversal of 14241021424130 is 3142412014241.
It is a junction number, because it is equal to n+sod(n) for n = 14241021424093 and 14241021424102.
It is not an unprimeable number, because it can be changed into a prime (14241021424139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 63262475 + ... + 63487185.
It is an arithmetic number, because the mean of its divisors is an integer number (407335217688).
Almost surely, 214241021424130 is an apocalyptic number.
14241021424130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14241021424130 is a deficient number, since it is larger than the sum of its proper divisors (11828432507902).
14241021424130 is a wasteful number, since it uses less digits than its factorization.
14241021424130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 225299.
The product of its (nonzero) digits is 6144, while the sum is 29.
Adding to 14241021424130 its reverse (3142412014241), we get a palindrome (17383433438371).
The spelling of 14241021424130 in words is "fourteen trillion, two hundred forty-one billion, twenty-one million, four hundred twenty-four thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •