Base | Representation |
---|---|
bin | 1111110111111110101… |
… | …11001111111110101101 |
3 | 1221010220100201021102011 |
4 | 13323333113033332231 |
5 | 32414040220223031 |
6 | 1054324254001221 |
7 | 54256522616461 |
oct | 7737727177655 |
9 | 1833810637364 |
10 | 545450164141 |
11 | 1a0362441523 |
12 | 898661a6211 |
13 | 3c5883b551c |
14 | 1c5855944a1 |
15 | e2c5d436b1 |
hex | 7eff5cffad |
545450164141 has 16 divisors (see below), whose sum is σ = 582400767168. Its totient is φ = 509046304000.
The previous prime is 545450164111. The next prime is 545450164253. The reversal of 545450164141 is 141461054545.
It is a cyclic number.
It is not a de Polignac number, because 545450164141 - 225 = 545416609709 is a prime.
It is a super-2 number, since 2×5454501641412 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 545450164094 and 545450164103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (545450164111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2761791 + ... + 2952691.
It is an arithmetic number, because the mean of its divisors is an integer number (36400047948).
Almost surely, 2545450164141 is an apocalyptic number.
It is an amenable number.
545450164141 is a deficient number, since it is larger than the sum of its proper divisors (36950603027).
545450164141 is a wasteful number, since it uses less digits than its factorization.
545450164141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192332.
The product of its (nonzero) digits is 192000, while the sum is 40.
The spelling of 545450164141 in words is "five hundred forty-five billion, four hundred fifty million, one hundred sixty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •