Base | Representation |
---|---|
bin | 1100100011100000… |
… | …0000101011010001 |
3 | 22200212111010210201 |
4 | 3020320000223101 |
5 | 23400223013113 |
6 | 1314225255201 |
7 | 146341412221 |
oct | 31070005321 |
9 | 8625433721 |
10 | 3370126033 |
11 | 147a39162a |
12 | 7a0794501 |
13 | 419296321 |
14 | 23d832081 |
15 | 14ad05cdd |
hex | c8e00ad1 |
3370126033 has 8 divisors (see below), whose sum is σ = 3486887936. Its totient is φ = 3253867200.
The previous prime is 3370126027. The next prime is 3370126057. The reversal of 3370126033 is 3306210733.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3370126033 is a prime.
It is a super-2 number, since 2×33701260332 = 22715498956608634178, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3370125992 and 3370126010.
It is not an unprimeable number, because it can be changed into a prime (3370126013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 112113 + ... + 138958.
It is an arithmetic number, because the mean of its divisors is an integer number (435860992).
Almost surely, 23370126033 is an apocalyptic number.
It is an amenable number.
3370126033 is a deficient number, since it is larger than the sum of its proper divisors (116761903).
3370126033 is a wasteful number, since it uses less digits than its factorization.
3370126033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 251535.
The product of its (nonzero) digits is 6804, while the sum is 28.
The square root of 3370126033 is about 58052.7866083963. The cubic root of 3370126033 is about 1499.2775829464.
Adding to 3370126033 its reverse (3306210733), we get a palindrome (6676336766).
The spelling of 3370126033 in words is "three billion, three hundred seventy million, one hundred twenty-six thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •