Base | Representation |
---|---|
bin | 111101111110010001110100… |
… | …0001011011001111110010000 |
3 | 2122111010001221211101122111210 |
4 | 1323330203220023121332100 |
5 | 1032422231100443344100 |
6 | 5211213110245540120 |
7 | 222551463064243041 |
oct | 17374435013317620 |
9 | 2574101854348453 |
10 | 545121144512400 |
11 | 148768640886635 |
12 | 51180168414640 |
13 | 1a52291b374131 |
14 | 988800b62c8c8 |
15 | 4304cba51bc50 |
hex | 1efc8e82d9f90 |
545121144512400 has 120 divisors (see below), whose sum is σ = 1848922658456544. Its totient is φ = 136814718617600.
The previous prime is 545121144512341. The next prime is 545121144512401. The reversal of 545121144512400 is 4215441121545.
It is a tau number, because it is divible by the number of its divisors (120).
It is not an unprimeable number, because it can be changed into a prime (545121144512401) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13360791966 + ... + 13360832765.
Almost surely, 2545121144512400 is an apocalyptic number.
545121144512400 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
545121144512400 is an abundant number, since it is smaller than the sum of its proper divisors (1303801513944144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
545121144512400 is a wasteful number, since it uses less digits than its factorization.
545121144512400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26721624769 (or 26721624758 counting only the distinct ones).
The product of its (nonzero) digits is 128000, while the sum is 39.
Adding to 545121144512400 its reverse (4215441121545), we get a palindrome (549336585633945).
The spelling of 545121144512400 in words is "five hundred forty-five trillion, one hundred twenty-one billion, one hundred forty-four million, five hundred twelve thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •