Base | Representation |
---|---|
bin | 1000011101100010… |
… | …00000010000100101 |
3 | 102201120212210021010 |
4 | 10032301000100211 |
5 | 33300412210222 |
6 | 2030433412433 |
7 | 220400160051 |
oct | 41661002045 |
9 | 12646783233 |
10 | 4542694437 |
11 | 1a21261626 |
12 | a6940a119 |
13 | 5751a4898 |
14 | 311460c61 |
15 | 1b8c2380c |
hex | 10ec40425 |
4542694437 has 8 divisors (see below), whose sum is σ = 6057280960. Its totient is φ = 3028285440.
The previous prime is 4542694411. The next prime is 4542694441. The reversal of 4542694437 is 7344962454.
4542694437 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4542694437 - 211 = 4542692389 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4542694447) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36264 + ... + 101982.
It is an arithmetic number, because the mean of its divisors is an integer number (757160120).
Almost surely, 24542694437 is an apocalyptic number.
It is an amenable number.
4542694437 is a deficient number, since it is larger than the sum of its proper divisors (1514586523).
4542694437 is a wasteful number, since it uses less digits than its factorization.
4542694437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88763.
The product of its digits is 2903040, while the sum is 48.
The square root of 4542694437 is about 67399.5136258415. The cubic root of 4542694437 is about 1656.1684549253.
The spelling of 4542694437 in words is "four billion, five hundred forty-two million, six hundred ninety-four thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •