Base | Representation |
---|---|
bin | 1100011111010001… |
… | …1111110010100001 |
3 | 22122122011222020012 |
4 | 3013310133302201 |
5 | 23331210141211 |
6 | 1312354054305 |
7 | 146035110431 |
oct | 30764376241 |
9 | 8578158205 |
10 | 3352427681 |
11 | 14703a3599 |
12 | 79687a395 |
13 | 41570a725 |
14 | 23b3462c1 |
15 | 1494abd8b |
hex | c7d1fca1 |
3352427681 has 4 divisors (see below), whose sum is σ = 3378018864. Its totient is φ = 3326836500.
The previous prime is 3352427677. The next prime is 3352427711. The reversal of 3352427681 is 1867242533.
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: 1867242533 = 13 ⋅143634041.
It is a cyclic number.
It is not a de Polignac number, because 3352427681 - 22 = 3352427677 is a prime.
It is a super-2 number, since 2×33524276812 = 22477542712670075522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3352427641) 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, 12795395 + ... + 12795656.
It is an arithmetic number, because the mean of its divisors is an integer number (844504716).
Almost surely, 23352427681 is an apocalyptic number.
It is an amenable number.
3352427681 is a deficient number, since it is larger than the sum of its proper divisors (25591183).
3352427681 is a wasteful number, since it uses less digits than its factorization.
3352427681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25591182.
The product of its digits is 241920, while the sum is 41.
The square root of 3352427681 is about 57900.1526854636. The cubic root of 3352427681 is about 1496.6484698150.
The spelling of 3352427681 in words is "three billion, three hundred fifty-two million, four hundred twenty-seven thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •