Base | Representation |
---|---|
bin | 1111110010011010101… |
… | …00001111110001100111 |
3 | 1220212012011220021001002 |
4 | 13321031110033301213 |
5 | 32341431014014143 |
6 | 1053112025223515 |
7 | 54122511460604 |
oct | 7711524176147 |
9 | 1825164807032 |
10 | 542463032423 |
11 | 19a06a270224 |
12 | 89171931b9b |
13 | 3c200588270 |
14 | 1c38097b6ab |
15 | e19d9925b8 |
hex | 7e4d50fc67 |
542463032423 has 8 divisors (see below), whose sum is σ = 614937850800. Its totient is φ = 474380627328.
The previous prime is 542463032411. The next prime is 542463032479. The reversal of 542463032423 is 324230364245.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 542463032423 - 218 = 542462770279 is a prime.
It is a super-2 number, since 2×5424630324232 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (542463032483) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1098103058 + ... + 1098103551.
It is an arithmetic number, because the mean of its divisors is an integer number (76867231350).
Almost surely, 2542463032423 is an apocalyptic number.
542463032423 is a deficient number, since it is larger than the sum of its proper divisors (72474818377).
542463032423 is a wasteful number, since it uses less digits than its factorization.
542463032423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2196206641.
The product of its (nonzero) digits is 414720, while the sum is 38.
Adding to 542463032423 its reverse (324230364245), we get a palindrome (866693396668).
The spelling of 542463032423 in words is "five hundred forty-two billion, four hundred sixty-three million, thirty-two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •