Base | Representation |
---|---|
bin | 1001011001001000… |
… | …11111110110010001 |
3 | 111000102210100102220 |
4 | 10230210133312101 |
5 | 40311414414213 |
6 | 2152215131253 |
7 | 235651342554 |
oct | 45444376621 |
9 | 14012710386 |
10 | 5042732433 |
11 | 2158544572 |
12 | b88973b29 |
13 | 62497105b |
14 | 35ba2669b |
15 | 1e7a97e23 |
hex | 12c91fd91 |
5042732433 has 16 divisors (see below), whose sum is σ = 6750751680. Its totient is φ = 3348291584.
The previous prime is 5042732417. The next prime is 5042732437. The reversal of 5042732433 is 3342372405.
It is a cyclic number.
It is not a de Polignac number, because 5042732433 - 24 = 5042732417 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5042732394 and 5042732403.
It is not an unprimeable number, because it can be changed into a prime (5042732437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1076785 + ... + 1081457.
It is an arithmetic number, because the mean of its divisors is an integer number (421921980).
Almost surely, 25042732433 is an apocalyptic number.
It is an amenable number.
5042732433 is a deficient number, since it is larger than the sum of its proper divisors (1708019247).
5042732433 is a wasteful number, since it uses less digits than its factorization.
5042732433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6048.
The product of its (nonzero) digits is 60480, while the sum is 33.
The square root of 5042732433 is about 71012.1991843655. The cubic root of 5042732433 is about 1714.8335631675.
The spelling of 5042732433 in words is "five billion, forty-two million, seven hundred thirty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •