Base | Representation |
---|---|
bin | 101011110011011001001… |
… | …101100101001011001101 |
3 | 101122202122112022202201211 |
4 | 223303121031211023031 |
5 | 343304212024320323 |
6 | 10222455230334421 |
7 | 430321420041034 |
oct | 53633115451315 |
9 | 11582575282654 |
10 | 3010121323213 |
11 | a60649016704 |
12 | 40746b65a411 |
13 | 18ab126b8654 |
14 | a59951db71b |
15 | 534780b970d |
hex | 2bcd93652cd |
3010121323213 has 6 divisors (see below), whose sum is σ = 3197602928426. Its totient is φ = 2833055362752.
The previous prime is 3010121323199. The next prime is 3010121323219. The reversal of 3010121323213 is 3123231210103.
It can be written as a sum of positive squares in 3 ways, for example, as 330001993764 + 2680119329449 = 574458^2 + 1637107^2 .
It is a de Polignac number, because none of the positive numbers 2k-3010121323213 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 (3010121323219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5207822070 + ... + 5207822647.
Almost surely, 23010121323213 is an apocalyptic number.
It is an amenable number.
3010121323213 is a deficient number, since it is larger than the sum of its proper divisors (187481605213).
3010121323213 is a wasteful number, since it uses less digits than its factorization.
3010121323213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10415644751 (or 10415644734 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 3010121323213 its reverse (3123231210103), we get a palindrome (6133352533316).
The spelling of 3010121323213 in words is "three trillion, ten billion, one hundred twenty-one million, three hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •