Base | Representation |
---|---|
bin | 1011000000000110… |
… | …01101111111000001 |
3 | 120020121222102012000 |
4 | 11200003031333001 |
5 | 44044021024440 |
6 | 2414031054213 |
7 | 266236526205 |
oct | 54003157701 |
9 | 16217872160 |
10 | 5906423745 |
11 | 2561027642 |
12 | 118a071369 |
13 | 7318940c1 |
14 | 400610b05 |
15 | 248801730 |
hex | 1600cdfc1 |
5906423745 has 32 divisors (see below), whose sum is σ = 10507718400. Its totient is φ = 3147869952.
The previous prime is 5906423741. The next prime is 5906423749. The reversal of 5906423745 is 5473246095.
It is an interprime number because it is at equal distance from previous prime (5906423741) and next prime (5906423749).
It is not a de Polignac number, because 5906423745 - 22 = 5906423741 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 5906423745.
It is not an unprimeable number, because it can be changed into a prime (5906423741) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 186324 + ... + 215706.
It is an arithmetic number, because the mean of its divisors is an integer number (328366200).
Almost surely, 25906423745 is an apocalyptic number.
It is an amenable number.
5906423745 is a deficient number, since it is larger than the sum of its proper divisors (4601294655).
5906423745 is a wasteful number, since it uses less digits than its factorization.
5906423745 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30886 (or 30880 counting only the distinct ones).
The product of its (nonzero) digits is 907200, while the sum is 45.
The square root of 5906423745 is about 76853.2611214384. The cubic root of 5906423745 is about 1807.6244228324.
The spelling of 5906423745 in words is "five billion, nine hundred six million, four hundred twenty-three thousand, seven hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •