Base | Representation |
---|---|
bin | 100111100110010111100… |
… | …1000011111101010001100 |
3 | 201021022002011212201112220 |
4 | 1033030233020133222030 |
5 | 1203132232131220022 |
6 | 15324131230055340 |
7 | 1101131402264040 |
oct | 117145710375214 |
9 | 21238064781486 |
10 | 5442514320012 |
11 | 18091804a1820 |
12 | 73a96704a550 |
13 | 3062c4659283 |
14 | 14b5c2014020 |
15 | 9688b70a85c |
hex | 4f32f21fa8c |
5442514320012 has 96 divisors (see below), whose sum is σ = 15888715874304. Its totient is φ = 1408644820800.
The previous prime is 5442514319999. The next prime is 5442514320013. The reversal of 5442514320012 is 2100234152445.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (5442514320013) 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, 10145164 + ... + 10668147.
It is an arithmetic number, because the mean of its divisors is an integer number (165507457024).
Almost surely, 25442514320012 is an apocalyptic number.
It is an amenable number.
5442514320012 is an abundant number, since it is smaller than the sum of its proper divisors (10446201554292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5442514320012 is a wasteful number, since it uses less digits than its factorization.
5442514320012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20813619 (or 20813617 counting only the distinct ones).
The product of its (nonzero) digits is 38400, while the sum is 33.
Adding to 5442514320012 its reverse (2100234152445), we get a palindrome (7542748472457).
The spelling of 5442514320012 in words is "five trillion, four hundred forty-two billion, five hundred fourteen million, three hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •