Base | Representation |
---|---|
bin | 1011101110010001000010… |
… | …0001000000001111010000 |
3 | 1200122012222121020001122120 |
4 | 2323210100201000033100 |
5 | 3142140120312124410 |
6 | 43225201555334240 |
7 | 2500143115535502 |
oct | 273442041001720 |
9 | 50565877201576 |
10 | 12889473942480 |
11 | 411a439015903 |
12 | 15420968b1380 |
13 | 72661a4b1a95 |
14 | 327bd5025d72 |
15 | 1754412ca570 |
hex | bb9108403d0 |
12889473942480 has 80 divisors (see below), whose sum is σ = 39967542002880. Its totient is φ = 3436317973504.
The previous prime is 12889473942479. The next prime is 12889473942511. The reversal of 12889473942480 is 8424937498821.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×128894739424802 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5891622 + ... + 7777541.
It is an arithmetic number, because the mean of its divisors is an integer number (499594275036).
Almost surely, 212889473942480 is an apocalyptic number.
12889473942480 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12889473942480 is an abundant number, since it is smaller than the sum of its proper divisors (27078068060400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12889473942480 is a wasteful number, since it uses less digits than its factorization.
12889473942480 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13673108 (or 13673102 counting only the distinct ones).
The product of its (nonzero) digits is 222953472, while the sum is 69.
The spelling of 12889473942480 in words is "twelve trillion, eight hundred eighty-nine billion, four hundred seventy-three million, nine hundred forty-two thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •