Base | Representation |
---|---|
bin | 1011010011010111… |
… | …0001100111100001 |
3 | 21211102222221201210 |
4 | 2310311301213201 |
5 | 22203200330440 |
6 | 1221021020333 |
7 | 135120352434 |
oct | 26465614741 |
9 | 7742887653 |
10 | 3033995745 |
11 | 131767aa00 |
12 | 7080b46a9 |
13 | 394758171 |
14 | 20ad3581b |
15 | 12b55ba80 |
hex | b4d719e1 |
3033995745 has 48 divisors (see below), whose sum is σ = 5480153280. Its totient is φ = 1431239040.
The previous prime is 3033995743. The next prime is 3033995771. The reversal of 3033995745 is 5475993303.
It is not a de Polignac number, because 3033995745 - 21 = 3033995743 is a prime.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 3033995694 and 3033995703.
It is not an unprimeable number, because it can be changed into a prime (3033995743) 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 47 ways as a sum of consecutive naturals, for example, 44566 + ... + 89744.
It is an arithmetic number, because the mean of its divisors is an integer number (114169860).
Almost surely, 23033995745 is an apocalyptic number.
It is an amenable number.
3033995745 is a deficient number, since it is larger than the sum of its proper divisors (2446157535).
3033995745 is a wasteful number, since it uses less digits than its factorization.
3033995745 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45246 (or 45235 counting only the distinct ones).
The product of its (nonzero) digits is 1530900, while the sum is 48.
The square root of 3033995745 is about 55081.7187912650. The cubic root of 3033995745 is about 1447.6769373348.
The spelling of 3033995745 in words is "three billion, thirty-three million, nine hundred ninety-five thousand, seven hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •