Base | Representation |
---|---|
bin | 1111110001101000101… |
… | …00011010001001011001 |
3 | 1220211002221202010222020 |
4 | 13320310110122021121 |
5 | 32340101133111010 |
6 | 1053002244245053 |
7 | 54106226646366 |
oct | 7706424321131 |
9 | 1824087663866 |
10 | 542043644505 |
11 | 199974562940 |
12 | 890753a0789 |
13 | 3c16471902c |
14 | 1c340dab46d |
15 | e176c4e470 |
hex | 7e3451a259 |
542043644505 has 96 divisors (see below), whose sum is σ = 1037463441408. Its totient is φ = 239370009600.
The previous prime is 542043644491. The next prime is 542043644507. The reversal of 542043644505 is 505446340245.
It is a happy number.
It is not a de Polignac number, because 542043644505 - 24 = 542043644489 is a prime.
It is a super-2 number, since 2×5420436445052 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (542043644507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1294894 + ... + 1661576.
It is an arithmetic number, because the mean of its divisors is an integer number (10806910848).
Almost surely, 2542043644505 is an apocalyptic number.
542043644505 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
542043644505 is a deficient number, since it is larger than the sum of its proper divisors (495419796903).
542043644505 is a wasteful number, since it uses less digits than its factorization.
542043644505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 366767 (or 366750 counting only the distinct ones).
The product of its (nonzero) digits is 1152000, while the sum is 42.
The spelling of 542043644505 in words is "five hundred forty-two billion, forty-three million, six hundred forty-four thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •