Base | Representation |
---|---|
bin | 101101001010110110101… |
… | …100000110000100010011 |
3 | 101222202001021200222010202 |
4 | 231022312230012010103 |
5 | 401324024014301321 |
6 | 10333550005245415 |
7 | 440154535366010 |
oct | 55126654060423 |
9 | 11882037628122 |
10 | 3104031400211 |
11 | a97459892495 |
12 | 4216b9a0386b |
13 | 19692a606451 |
14 | aa343522707 |
15 | 55b2285770b |
hex | 2d2b6b06113 |
3104031400211 has 4 divisors (see below), whose sum is σ = 3547464457392. Its totient is φ = 2660598343032.
The previous prime is 3104031400201. The next prime is 3104031400259. The reversal of 3104031400211 is 1120041304013.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 3104031400211 - 238 = 2829153493267 is a prime.
It is a super-2 number, since 2×31040314002112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3104031400201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 221716528580 + ... + 221716528593.
It is an arithmetic number, because the mean of its divisors is an integer number (886866114348).
Almost surely, 23104031400211 is an apocalyptic number.
3104031400211 is a deficient number, since it is larger than the sum of its proper divisors (443433057181).
3104031400211 is an equidigital number, since it uses as much as digits as its factorization.
3104031400211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 443433057180.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 3104031400211 its reverse (1120041304013), we get a palindrome (4224072704224).
The spelling of 3104031400211 in words is "three trillion, one hundred four billion, thirty-one million, four hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •