Base | Representation |
---|---|
bin | 101011101001111110100… |
… | …110100100000111001011 |
3 | 101121210112221100212100011 |
4 | 223221332212210013023 |
5 | 343123010332224321 |
6 | 10214104111452351 |
7 | 426513034356610 |
oct | 53517646440713 |
9 | 11553487325304 |
10 | 3000011211211 |
11 | a57330133943 |
12 | 4055098270b7 |
13 | 189b90c56b61 |
14 | a52b65b4507 |
15 | 5308570aae1 |
hex | 2ba7e9a41cb |
3000011211211 has 4 divisors (see below), whose sum is σ = 3428584241392. Its totient is φ = 2571438181032.
The previous prime is 3000011211181. The next prime is 3000011211227. The reversal of 3000011211211 is 1121121100003.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 3000011211211 - 211 = 3000011209163 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3000011211191 and 3000011211200.
It is not an unprimeable number, because it can be changed into a prime (3000011211511) 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 3 ways as a sum of consecutive naturals, for example, 214286515080 + ... + 214286515093.
It is an arithmetic number, because the mean of its divisors is an integer number (857146060348).
Almost surely, 23000011211211 is an apocalyptic number.
3000011211211 is a deficient number, since it is larger than the sum of its proper divisors (428573030181).
3000011211211 is an equidigital number, since it uses as much as digits as its factorization.
3000011211211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 428573030180.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 3000011211211 its reverse (1121121100003), we get a palindrome (4121132311214).
The spelling of 3000011211211 in words is "three trillion, eleven million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •