Base | Representation |
---|---|
bin | 101011101010001010100… |
… | …101000000110110000001 |
3 | 101121211001221102122202021 |
4 | 223222022211000312001 |
5 | 343123413301144301 |
6 | 10214140050121441 |
7 | 426521024225305 |
oct | 53521245006601 |
9 | 11554057378667 |
10 | 3000212131201 |
11 | a5742359501a |
12 | 405564b80281 |
13 | 189bc3773b1c |
14 | a52d5155d05 |
15 | 530981978a1 |
hex | 2ba8a940d81 |
3000212131201 has 4 divisors (see below), whose sum is σ = 3018177473472. Its totient is φ = 2982246788932.
The previous prime is 3000212131153. The next prime is 3000212131271. The reversal of 3000212131201 is 1021312120003.
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 a cyclic number.
It is not a de Polignac number, because 3000212131201 - 211 = 3000212129153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3000212131271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8982670885 + ... + 8982671218.
It is an arithmetic number, because the mean of its divisors is an integer number (754544368368).
Almost surely, 23000212131201 is an apocalyptic number.
It is an amenable number.
3000212131201 is a deficient number, since it is larger than the sum of its proper divisors (17965342271).
3000212131201 is a wasteful number, since it uses less digits than its factorization.
3000212131201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17965342270.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 3000212131201 its reverse (1021312120003), we get a palindrome (4021524251204).
The spelling of 3000212131201 in words is "three trillion, two hundred twelve million, one hundred thirty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •