Base | Representation |
---|---|
bin | 1011001110101001… |
… | …0101110011011101 |
3 | 21210001210021220121 |
4 | 2303222111303131 |
5 | 22133120033041 |
6 | 1215033114541 |
7 | 134460312250 |
oct | 26352256335 |
9 | 7701707817 |
10 | 3014221021 |
11 | 13074a3959 |
12 | 701558a51 |
13 | 390623446 |
14 | 208469097 |
15 | 1299527d1 |
hex | b3a95cdd |
3014221021 has 8 divisors (see below), whose sum is σ = 3537927680. Its totient is φ = 2513790288.
The previous prime is 3014221003. The next prime is 3014221031. The reversal of 3014221021 is 1201224103.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3014221021 - 211 = 3014218973 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3014220986 and 3014221004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3014221031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5818701 + ... + 5819218.
It is an arithmetic number, because the mean of its divisors is an integer number (442240960).
Almost surely, 23014221021 is an apocalyptic number.
It is an amenable number.
3014221021 is a deficient number, since it is larger than the sum of its proper divisors (523706659).
3014221021 is a wasteful number, since it uses less digits than its factorization.
3014221021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11637963.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 3014221021 is about 54901.9218333930. The cubic root of 3014221021 is about 1444.5248967481.
Adding to 3014221021 its reverse (1201224103), we get a palindrome (4215445124).
The spelling of 3014221021 in words is "three billion, fourteen million, two hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •