Base | Representation |
---|---|
bin | 1011111101000001111100… |
… | …0011110101010000000000 |
3 | 1201112110200200221212002011 |
4 | 2333100133003311100000 |
5 | 3210314102440232000 |
6 | 43541511052502304 |
7 | 2524362535261132 |
oct | 277203703652000 |
9 | 51473620855064 |
10 | 13143121024000 |
11 | 4207a6a1a5410 |
12 | 158328477a994 |
13 | 744511026976 |
14 | 3361b7d61052 |
15 | 17bd393a62ba |
hex | bf41f0f5400 |
13143121024000 has 176 divisors, whose sum is σ = 35770053174336. Its totient is φ = 4779316224000.
The previous prime is 13143121023931. The next prime is 13143121024009. The reversal of 13143121024000 is 42012134131.
It is a tau number, because it is divible by the number of its divisors (176).
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13143121024009) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3259302 + ... + 6075301.
Almost surely, 213143121024000 is an apocalyptic number.
13143121024000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13143121024000 is an abundant number, since it is smaller than the sum of its proper divisors (22626932150336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13143121024000 is an equidigital number, since it uses as much as digits as its factorization.
13143121024000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9334649 (or 9334621 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 13143121024000 its reverse (42012134131), we get a palindrome (13185133158131).
The spelling of 13143121024000 in words is "thirteen trillion, one hundred forty-three billion, one hundred twenty-one million, twenty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •