Base | Representation |
---|---|
bin | 101011110101010000010… |
… | …111000101000111000101 |
3 | 101122221210211202102010222 |
4 | 223311100113011013011 |
5 | 343322310244131041 |
6 | 10223425435354125 |
7 | 430422102060425 |
oct | 53652027050705 |
9 | 11587724672128 |
10 | 3012120302021 |
11 | a61484426006 |
12 | 407928bb2945 |
13 | 18b070895c4c |
14 | a5b048ac485 |
15 | 5354382974b |
hex | 2bd505c51c5 |
3012120302021 has 8 divisors (see below), whose sum is σ = 3020270217720. Its totient is φ = 3003981204672.
The previous prime is 3012120302017. The next prime is 3012120302029. The reversal of 3012120302021 is 1202030212103.
It can be written as a sum of positive squares in 4 ways, for example, as 361247879521 + 2650872422500 = 601039^2 + 1628150^2 .
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 3012120302021 - 22 = 3012120302017 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 (3012120302029) 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, 2146826 + ... + 3260843.
It is an arithmetic number, because the mean of its divisors is an integer number (377533777215).
Almost surely, 23012120302021 is an apocalyptic number.
It is an amenable number.
3012120302021 is a deficient number, since it is larger than the sum of its proper divisors (8149915699).
3012120302021 is an equidigital number, since it uses as much as digits as its factorization.
3012120302021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5409175.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 3012120302021 its reverse (1202030212103), we get a palindrome (4214150514124).
The spelling of 3012120302021 in words is "three trillion, twelve billion, one hundred twenty million, three hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •