Base | Representation |
---|---|
bin | 111000100111001001100… |
… | …010101011111001101011 |
3 | 111202220121120001121200002 |
4 | 320213021202223321223 |
5 | 1002214342114403021 |
6 | 12135105202533215 |
7 | 551031631322351 |
oct | 70471142537153 |
9 | 14686546047602 |
10 | 3890326716011 |
11 | 126a97301309a |
12 | 529b7a66720b |
13 | 222b191c1918 |
14 | d64156c57d1 |
15 | 6b2e28ec50b |
hex | 389c98abe6b |
3890326716011 has 4 divisors (see below), whose sum is σ = 3937198122312. Its totient is φ = 3843455309712.
The previous prime is 3890326716007. The next prime is 3890326716013. The reversal of 3890326716011 is 1106176230983.
It is a happy number.
3890326716011 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 3890326716011 - 22 = 3890326716007 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3890326716013) 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, 23435703026 + ... + 23435703191.
It is an arithmetic number, because the mean of its divisors is an integer number (984299530578).
Almost surely, 23890326716011 is an apocalyptic number.
3890326716011 is a deficient number, since it is larger than the sum of its proper divisors (46871406301).
3890326716011 is an equidigital number, since it uses as much as digits as its factorization.
3890326716011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46871406300.
The product of its (nonzero) digits is 326592, while the sum is 47.
The spelling of 3890326716011 in words is "three trillion, eight hundred ninety billion, three hundred twenty-six million, seven hundred sixteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •