Base | Representation |
---|---|
bin | 1100110010001000100001… |
… | …1001101000001101111100 |
3 | 1211202200111111002101211120 |
4 | 3030202020121220031330 |
5 | 3320241000340142340 |
6 | 45520545500150540 |
7 | 2650320305522616 |
oct | 314421031501574 |
9 | 54680444071746 |
10 | 14055421412220 |
11 | 4529963a65a01 |
12 | 16b0050238450 |
13 | 7ac560c4cca6 |
14 | 368400bd9db6 |
15 | 1959316dc4d0 |
hex | cc88866837c |
14055421412220 has 48 divisors (see below), whose sum is σ = 39359673513888. Its totient is φ = 3747684418560.
The previous prime is 14055421412203. The next prime is 14055421412231. The reversal of 14055421412220 is 2221412455041.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12843649 + ... + 13894968.
It is an arithmetic number, because the mean of its divisors is an integer number (819993198206).
Almost surely, 214055421412220 is an apocalyptic number.
14055421412220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14055421412220 is an abundant number, since it is smaller than the sum of its proper divisors (25304252101668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14055421412220 is a wasteful number, since it uses less digits than its factorization.
14055421412220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26747390 (or 26747388 counting only the distinct ones).
The product of its (nonzero) digits is 25600, while the sum is 33.
Adding to 14055421412220 its reverse (2221412455041), we get a palindrome (16276833867261).
The spelling of 14055421412220 in words is "fourteen trillion, fifty-five billion, four hundred twenty-one million, four hundred twelve thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •