Base | Representation |
---|---|
bin | 1111110111111100111… |
… | …01111000010110000000 |
3 | 1221010212022102012202101 |
4 | 13323332131320112000 |
5 | 32414022343000440 |
6 | 1054322555400144 |
7 | 54256251032104 |
oct | 7737635702600 |
9 | 1833768365671 |
10 | 545435125120 |
11 | 1a03549aa486 |
12 | 89861153054 |
13 | 3c58524b1b2 |
14 | 1c58359b904 |
15 | e2c487269a |
hex | 7efe778580 |
545435125120 has 32 divisors (see below), whose sum is σ = 1303930847520. Its totient is φ = 218174049792.
The previous prime is 545435125097. The next prime is 545435125163. The reversal of 545435125120 is 21521534545.
It is a tau number, because it is divible by the number of its divisors (32).
It is a self number, because there is not a number n which added to its sum of digits gives 545435125120.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 426120552 + ... + 426121831.
It is an arithmetic number, because the mean of its divisors is an integer number (40747838985).
Almost surely, 2545435125120 is an apocalyptic number.
It is an amenable number.
545435125120 is an abundant number, since it is smaller than the sum of its proper divisors (758495722400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
545435125120 is an equidigital number, since it uses as much as digits as its factorization.
545435125120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 852242402 (or 852242390 counting only the distinct ones).
The product of its (nonzero) digits is 120000, while the sum is 37.
Adding to 545435125120 its reverse (21521534545), we get a palindrome (566956659665).
The spelling of 545435125120 in words is "five hundred forty-five billion, four hundred thirty-five million, one hundred twenty-five thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •