Base | Representation |
---|---|
bin | 100100100111110010010… |
… | …0100010000011100011000 |
3 | 122211011200020200220001110 |
4 | 1021033210210100130120 |
5 | 1124431034300212100 |
6 | 14412123355220320 |
7 | 1026432262053624 |
oct | 111174444203430 |
9 | 18734606626043 |
10 | 5033241413400 |
11 | 167064961a442 |
12 | 6935864476a0 |
13 | 2a682bb67b55 |
14 | 1358784ba184 |
15 | 8add5bc9250 |
hex | 493e4910718 |
5033241413400 has 96 divisors (see below), whose sum is σ = 15757534198800. Its totient is φ = 1328908608000.
The previous prime is 5033241413383. The next prime is 5033241413401. The reversal of 5033241413400 is 43141423305.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5033241413401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 41467795 + ... + 41588994.
Almost surely, 25033241413400 is an apocalyptic number.
5033241413400 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5033241413400 is an abundant number, since it is smaller than the sum of its proper divisors (10724292785400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5033241413400 is a wasteful number, since it uses less digits than its factorization.
5033241413400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83056909 (or 83056900 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 5033241413400 its reverse (43141423305), we get a palindrome (5076382836705).
The spelling of 5033241413400 in words is "five trillion, thirty-three billion, two hundred forty-one million, four hundred thirteen thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •