Base | Representation |
---|---|
bin | 1100010101000101… |
… | …0100100001111101 |
3 | 22112122200202011011 |
4 | 3011101110201331 |
5 | 23234232331333 |
6 | 1304225155221 |
7 | 145005402316 |
oct | 30521244175 |
9 | 8478622134 |
10 | 3309652093 |
11 | 1449237670 |
12 | 78448bb11 |
13 | 4098b1727 |
14 | 2357ad60d |
15 | 14585c9cd |
hex | c545487d |
3309652093 has 4 divisors (see below), whose sum is σ = 3610529568. Its totient is φ = 3008774620.
The previous prime is 3309652081. The next prime is 3309652097. The reversal of 3309652093 is 3902569033.
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.
It is a cyclic number.
It is not a de Polignac number, because 3309652093 - 213 = 3309643901 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3309652097) 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, 150438721 + ... + 150438742.
It is an arithmetic number, because the mean of its divisors is an integer number (902632392).
Almost surely, 23309652093 is an apocalyptic number.
It is an amenable number.
3309652093 is a deficient number, since it is larger than the sum of its proper divisors (300877475).
3309652093 is a wasteful number, since it uses less digits than its factorization.
3309652093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 300877474.
The product of its (nonzero) digits is 131220, while the sum is 40.
The square root of 3309652093 is about 57529.5758110557. The cubic root of 3309652093 is about 1490.2556642802.
The spelling of 3309652093 in words is "three billion, three hundred nine million, six hundred fifty-two thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •