Base | Representation |
---|---|
bin | 1001000011010100011… |
… | …11111111101100000000 |
3 | 1002201210112102101001010 |
4 | 10201222033333230000 |
5 | 20043432134120412 |
6 | 354514122440520 |
7 | 31320241164135 |
oct | 4415217775400 |
9 | 1081715371033 |
10 | 311020223232 |
11 | 10a9a2898104 |
12 | 50340063140 |
13 | 23437cb7164 |
14 | 110a699858c |
15 | 8154de533c |
hex | 486a3ffb00 |
311020223232 has 36 divisors (see below), whose sum is σ = 827767367000. Its totient is φ = 103673407488.
The previous prime is 311020223203. The next prime is 311020223243. The reversal of 311020223232 is 232322020113.
It is a happy number.
It is a super-2 number, since 2×3110202232322 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 311020223199 and 311020223208.
It is an unprimeable number.
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, 202486357 + ... + 202487892.
Almost surely, 2311020223232 is an apocalyptic number.
311020223232 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
311020223232 is an abundant number, since it is smaller than the sum of its proper divisors (516747143768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
311020223232 is an equidigital number, since it uses as much as digits as its factorization.
311020223232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 404974268 (or 404974254 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 311020223232 its reverse (232322020113), we get a palindrome (543342243345).
The spelling of 311020223232 in words is "three hundred eleven billion, twenty million, two hundred twenty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •