Base | Representation |
---|---|
bin | 1011010110011110010… |
… | …00010010011011110011 |
3 | 1101021201022102012012212 |
4 | 11223033020102123303 |
5 | 22342231130104021 |
6 | 455101303242335 |
7 | 40115053155326 |
oct | 5531710223363 |
9 | 1337638365185 |
10 | 390022113011 |
11 | 140453351203 |
12 | 637097493ab |
13 | 2aa183c3cbb |
14 | 14c3cd587bd |
15 | a22a95785b |
hex | 5acf2126f3 |
390022113011 has 2 divisors, whose sum is σ = 390022113012. Its totient is φ = 390022113010.
The previous prime is 390022113001. The next prime is 390022113017. The reversal of 390022113011 is 110311220093.
It is a strong prime.
It is an emirp because it is prime and its reverse (110311220093) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-390022113011 is a prime.
It is a super-2 number, since 2×3900221130112 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (390022113017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 195011056505 + 195011056506.
It is an arithmetic number, because the mean of its divisors is an integer number (195011056506).
Almost surely, 2390022113011 is an apocalyptic number.
390022113011 is a deficient number, since it is larger than the sum of its proper divisors (1).
390022113011 is an equidigital number, since it uses as much as digits as its factorization.
390022113011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 23.
The spelling of 390022113011 in words is "three hundred ninety billion, twenty-two million, one hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •