Base | Representation |
---|---|
bin | 101011110111000001100… |
… | …110010001111010001001 |
3 | 101200010201020120202111212 |
4 | 223313001212101322021 |
5 | 343340203122041014 |
6 | 10224342143102505 |
7 | 430520141146154 |
oct | 53670146217211 |
9 | 11603636522455 |
10 | 3014020112009 |
11 | a62269861405 |
12 | 4081792a1a35 |
13 | 18b2b436117a |
14 | a5c44d26c9b |
15 | 536054eb23e |
hex | 2bdc1991e89 |
3014020112009 has 4 divisors (see below), whose sum is σ = 3014058675204. Its totient is φ = 3013981548816.
The previous prime is 3014020111979. The next prime is 3014020112017. The reversal of 3014020112009 is 9002110204103.
3014020112009 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 466484902009 + 2547535210000 = 682997^2 + 1596100^2 .
It is a cyclic number.
It is not a de Polignac number, because 3014020112009 - 212 = 3014020107913 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3014020112039) 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, 19164122 + ... + 19320755.
It is an arithmetic number, because the mean of its divisors is an integer number (753514668801).
Almost surely, 23014020112009 is an apocalyptic number.
It is an amenable number.
3014020112009 is a deficient number, since it is larger than the sum of its proper divisors (38563195).
3014020112009 is an equidigital number, since it uses as much as digits as its factorization.
3014020112009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38563194.
The product of its (nonzero) digits is 432, while the sum is 23.
The spelling of 3014020112009 in words is "three trillion, fourteen billion, twenty million, one hundred twelve thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •