Base | Representation |
---|---|
bin | 1100100011101000… |
… | …1100000001100001 |
3 | 22200220120010202021 |
4 | 3020322030001201 |
5 | 23400344244201 |
6 | 1314245421441 |
7 | 146346310243 |
oct | 31072140141 |
9 | 8626503667 |
10 | 3370696801 |
11 | 147a74143a |
12 | 7a0a0a881 |
13 | 419436064 |
14 | 23d940093 |
15 | 14adb9ea1 |
hex | c8e8c061 |
3370696801 has 4 divisors (see below), whose sum is σ = 3370910400. Its totient is φ = 3370483204.
The previous prime is 3370696789. The next prime is 3370696829. The reversal of 3370696801 is 1086960733.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 1086960733 = 4111 ⋅264403.
It is a cyclic number.
It is not a de Polignac number, because 3370696801 - 27 = 3370696673 is a prime.
It is a super-2 number, since 2×33706968012 = 22723193848543267202, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3370696001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 81061 + ... + 115378.
It is an arithmetic number, because the mean of its divisors is an integer number (842727600).
Almost surely, 23370696801 is an apocalyptic number.
It is an amenable number.
3370696801 is a deficient number, since it is larger than the sum of its proper divisors (213599).
3370696801 is a wasteful number, since it uses less digits than its factorization.
3370696801 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 213598.
The product of its (nonzero) digits is 163296, while the sum is 43.
The square root of 3370696801 is about 58057.7023399996. The cubic root of 3370696801 is about 1499.3622178981.
The spelling of 3370696801 in words is "three billion, three hundred seventy million, six hundred ninety-six thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •