Base | Representation |
---|---|
bin | 101011110101010000111… |
… | …100111000000010110101 |
3 | 101122221211112101210022011 |
4 | 223311100330320002311 |
5 | 343322320313204343 |
6 | 10223430432004221 |
7 | 430422252224533 |
oct | 53652074700265 |
9 | 11587745353264 |
10 | 3012130209973 |
11 | a61489a82aa5 |
12 | 407930390671 |
13 | 18b072954941 |
14 | a5b05d2b153 |
15 | 5354463529d |
hex | 2bd50f380b5 |
3012130209973 has 2 divisors, whose sum is σ = 3012130209974. Its totient is φ = 3012130209972.
The previous prime is 3012130209877. The next prime is 3012130210021. The reversal of 3012130209973 is 3799020312103.
3012130209973 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2574333607729 + 437796602244 = 1604473^2 + 661662^2 .
It is an emirp because it is prime and its reverse (3799020312103) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3012130209973 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3012130209073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1506065104986 + 1506065104987.
It is an arithmetic number, because the mean of its divisors is an integer number (1506065104987).
Almost surely, 23012130209973 is an apocalyptic number.
It is an amenable number.
3012130209973 is a deficient number, since it is larger than the sum of its proper divisors (1).
3012130209973 is an equidigital number, since it uses as much as digits as its factorization.
3012130209973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 61236, while the sum is 40.
The spelling of 3012130209973 in words is "three trillion, twelve billion, one hundred thirty million, two hundred nine thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •