Base | Representation |
---|---|
bin | 1011010110110011101… |
… | …11101111000100001011 |
3 | 1101022011212111211010201 |
4 | 11223121313233010023 |
5 | 22343113243320321 |
6 | 455131221553031 |
7 | 40122402010441 |
oct | 5533167570413 |
9 | 1338155454121 |
10 | 390202323211 |
11 | 140536047858 |
12 | 63759b75777 |
13 | 2aa4683c75c |
14 | 14c58c68b91 |
15 | a23b6a3291 |
hex | 5ad9def10b |
390202323211 has 6 divisors (see below), whose sum is σ = 394266508260. Its totient is φ = 386179609536.
The previous prime is 390202323209. The next prime is 390202323221. The reversal of 390202323211 is 112323202093.
It is not a de Polignac number, because 390202323211 - 21 = 390202323209 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 390202323211.
It is not an unprimeable number, because it can be changed into a prime (390202323221) 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 5 ways as a sum of consecutive naturals, for example, 20726181 + ... + 20744998.
It is an arithmetic number, because the mean of its divisors is an integer number (65711084710).
Almost surely, 2390202323211 is an apocalyptic number.
390202323211 is a deficient number, since it is larger than the sum of its proper divisors (4064185049).
390202323211 is an frugal number, since it uses more digits than its factorization.
390202323211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41471373 (or 41471276 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 28.
The spelling of 390202323211 in words is "three hundred ninety billion, two hundred two million, three hundred twenty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •