Base | Representation |
---|---|
bin | 1111110010010111001… |
… | …00000011100001111000 |
3 | 1220212010010120001201012 |
4 | 13321023210003201320 |
5 | 32341401001402021 |
6 | 1053105055013052 |
7 | 54122003466410 |
oct | 7711344034170 |
9 | 1825103501635 |
10 | 542433622136 |
11 | 19a0547028aa |
12 | 89163b0a188 |
13 | 3c1c745b823 |
14 | 1c37aac3640 |
15 | e19b0d335b |
hex | 7e4b903878 |
542433622136 has 32 divisors (see below), whose sum is σ = 1162413229440. Its totient is φ = 232460458848.
The previous prime is 542433622103. The next prime is 542433622139. The reversal of 542433622136 is 631226334245.
It is a junction number, because it is equal to n+sod(n) for n = 542433622093 and 542433622102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (542433622139) 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 7 ways as a sum of consecutive naturals, for example, 1012055 + ... + 1452281.
It is an arithmetic number, because the mean of its divisors is an integer number (36325413420).
Almost surely, 2542433622136 is an apocalyptic number.
542433622136 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
542433622136 is an abundant number, since it is smaller than the sum of its proper divisors (619979607304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
542433622136 is a wasteful number, since it uses less digits than its factorization.
542433622136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 462243 (or 462239 counting only the distinct ones).
The product of its digits is 622080, while the sum is 41.
The spelling of 542433622136 in words is "five hundred forty-two billion, four hundred thirty-three million, six hundred twenty-two thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •