Base | Representation |
---|---|
bin | 101011101001111110100… |
… | …010101111101011100101 |
3 | 101121210112212110222222001 |
4 | 223221332202233223211 |
5 | 343123010103210041 |
6 | 10214104034205301 |
7 | 426513023016646 |
oct | 53517642575345 |
9 | 11553485428861 |
10 | 3000010210021 |
11 | a5732a60a710 |
12 | 405509423831 |
13 | 189b90996236 |
14 | a52b63d36cd |
15 | 530855ae131 |
hex | 2ba7e8afae5 |
3000010210021 has 4 divisors (see below), whose sum is σ = 3272738410944. Its totient is φ = 2727282009100.
The previous prime is 3000010209967. The next prime is 3000010210069. The reversal of 3000010210021 is 1200120100003.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 3000010210021 - 225 = 2999976655589 is a prime.
It is a super-2 number, since 2×30000102100212 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3000010211021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 136364100445 + ... + 136364100466.
It is an arithmetic number, because the mean of its divisors is an integer number (818184602736).
Almost surely, 23000010210021 is an apocalyptic number.
It is an amenable number.
3000010210021 is a deficient number, since it is larger than the sum of its proper divisors (272728200923).
3000010210021 is a wasteful number, since it uses less digits than its factorization.
3000010210021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 272728200922.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 3000010210021 its reverse (1200120100003), we get a palindrome (4200130310024).
The spelling of 3000010210021 in words is "three trillion, ten million, two hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •