Base | Representation |
---|---|
bin | 111101111110011110111111… |
… | …0011011111111111010001000 |
3 | 2122111012202222110101221021210 |
4 | 1323330331332123333322020 |
5 | 1032423212020410421024 |
6 | 5211234105422333120 |
7 | 222553514130443400 |
oct | 17374757633777210 |
9 | 2574182873357253 |
10 | 545149435248264 |
11 | 1487796391aa180 |
12 | 51185742a2a1a0 |
13 | 1a5254a9598022 |
14 | 9889532a5d800 |
15 | 43058c4062129 |
hex | 1efcf7e6ffe88 |
545149435248264 has 96 divisors (see below), whose sum is σ = 1729509340068000. Its totient is φ = 141597255905280.
The previous prime is 545149435248263. The next prime is 545149435248311. The reversal of 545149435248264 is 462842534941545.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is a junction number, because it is equal to n+sod(n) for n = 545149435248195 and 545149435248204.
It is not an unprimeable number, because it can be changed into a prime (545149435248263) 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, 21071007289 + ... + 21071033160.
It is an arithmetic number, because the mean of its divisors is an integer number (18015722292375).
Almost surely, 2545149435248264 is an apocalyptic number.
It is an amenable number.
545149435248264 is an abundant number, since it is smaller than the sum of its proper divisors (1184359904819736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
545149435248264 is a wasteful number, since it uses less digits than its factorization.
545149435248264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42142040483 (or 42142040472 counting only the distinct ones).
The product of its digits is 663552000, while the sum is 66.
The spelling of 545149435248264 in words is "five hundred forty-five trillion, one hundred forty-nine billion, four hundred thirty-five million, two hundred forty-eight thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •