Base | Representation |
---|---|
bin | 1100110001010010111111… |
… | …0111000011010110011101 |
3 | 1211201022101222201102202102 |
4 | 3030110233313003112131 |
5 | 3320022033032121141 |
6 | 45510211513334445 |
7 | 2646301222466162 |
oct | 314245767032635 |
9 | 54638358642672 |
10 | 14041051051421 |
11 | 452385a2a6169 |
12 | 16a92bb707425 |
13 | 7ab0b09a9514 |
14 | 36783a476069 |
15 | 19538ecec99b |
hex | cc52fdc359d |
14041051051421 has 8 divisors (see below), whose sum is σ = 14599783720704. Its totient is φ = 13488930603360.
The previous prime is 14041051051393. The next prime is 14041051051429. The reversal of 14041051051421 is 12415015014041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14041051051421 - 242 = 9643004540317 is a prime.
It is a super-2 number, since 2×140410510514212 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14041051051429) 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, 1653050975 + ... + 1653059468.
It is an arithmetic number, because the mean of its divisors is an integer number (1824972965088).
Almost surely, 214041051051421 is an apocalyptic number.
It is an amenable number.
14041051051421 is a deficient number, since it is larger than the sum of its proper divisors (558732669283).
14041051051421 is a wasteful number, since it uses less digits than its factorization.
14041051051421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3306110611.
The product of its (nonzero) digits is 3200, while the sum is 29.
Adding to 14041051051421 its reverse (12415015014041), we get a palindrome (26456066065462).
The spelling of 14041051051421 in words is "fourteen trillion, forty-one billion, fifty-one million, fifty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •