Base | Representation |
---|---|
bin | 1011111110010011… |
… | …1011101101011001 |
3 | 22021222221201111012 |
4 | 2333210323231121 |
5 | 23040304130014 |
6 | 1250533543305 |
7 | 142435440266 |
oct | 27744735531 |
9 | 8258851435 |
10 | 3214130009 |
11 | 13aa3244a2 |
12 | 7584a4b35 |
13 | 3c2b7819c |
14 | 226c2626d |
15 | 13c28ec3e |
hex | bf93bb59 |
3214130009 has 4 divisors (see below), whose sum is σ = 3353874816. Its totient is φ = 3074385204.
The previous prime is 3214129957. The next prime is 3214130033. The reversal of 3214130009 is 9000314123.
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 3214130009 - 28 = 3214129753 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23), and also a Moran number because the ratio is a prime number: 139744783 = 3214130009 / (3 + 2 + 1 + 4 + 1 + 3 + 0 + 0 + 0 + 9).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3214138009) 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, 69872369 + ... + 69872414.
It is an arithmetic number, because the mean of its divisors is an integer number (838468704).
Almost surely, 23214130009 is an apocalyptic number.
It is an amenable number.
3214130009 is a deficient number, since it is larger than the sum of its proper divisors (139744807).
3214130009 is a wasteful number, since it uses less digits than its factorization.
3214130009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139744806.
The product of its (nonzero) digits is 648, while the sum is 23.
The square root of 3214130009 is about 56693.2977432077. The cubic root of 3214130009 is about 1475.7783897290.
The spelling of 3214130009 in words is "three billion, two hundred fourteen million, one hundred thirty thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •