Base | Representation |
---|---|
bin | 101011110101011011000… |
… | …101000000010001111101 |
3 | 101122222021101002202110122 |
4 | 223311123011000101331 |
5 | 343323142312104041 |
6 | 10223455341344325 |
7 | 430426414330643 |
oct | 53653305002175 |
9 | 11588241082418 |
10 | 3012300113021 |
11 | a61566979741 |
12 | 4079792680a5 |
13 | 18b09bc01aa4 |
14 | a5b20717193 |
15 | 535544e6c4b |
hex | 2bd5b14047d |
3012300113021 has 8 divisors (see below), whose sum is σ = 3083643182400. Its totient is φ = 2941633281600.
The previous prime is 3012300113003. The next prime is 3012300113023. The reversal of 3012300113021 is 1203110032103.
3012300113021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3012300113021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3012300113023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 169050476 + ... + 169068293.
It is an arithmetic number, because the mean of its divisors is an integer number (385455397800).
Almost surely, 23012300113021 is an apocalyptic number.
It is an amenable number.
3012300113021 is a deficient number, since it is larger than the sum of its proper divisors (71343069379).
3012300113021 is a wasteful number, since it uses less digits than its factorization.
3012300113021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 338118979.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 3012300113021 its reverse (1203110032103), we get a palindrome (4215410145124).
The spelling of 3012300113021 in words is "three trillion, twelve billion, three hundred million, one hundred thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •