Base | Representation |
---|---|
bin | 111111001100000… |
… | …0000100100100011 |
3 | 12110202120111012012 |
4 | 1332120000210203 |
5 | 13320234114021 |
6 | 550215423135 |
7 | 103353412124 |
oct | 17630004443 |
9 | 5422514165 |
10 | 2120223011 |
11 | 9988a0a25 |
12 | 4b2084aab |
13 | 27a34b93a |
14 | 16183204b |
15 | c620e35b |
hex | 7e600923 |
2120223011 has 4 divisors (see below), whose sum is σ = 2123024592. Its totient is φ = 2117421432.
The previous prime is 2120222957. The next prime is 2120223047. The reversal of 2120223011 is 1103220212.
It is a happy number.
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 2120223011 - 26 = 2120222947 is a prime.
It is a super-2 number, since 2×21202230112 = 8990691232747812242, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2120223071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1399655 + ... + 1401168.
It is an arithmetic number, because the mean of its divisors is an integer number (530756148).
Almost surely, 22120223011 is an apocalyptic number.
2120223011 is a deficient number, since it is larger than the sum of its proper divisors (2801581).
2120223011 is an equidigital number, since it uses as much as digits as its factorization.
2120223011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2801580.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 2120223011 is about 46045.8794139063. The cubic root of 2120223011 is about 1284.6767012574.
Adding to 2120223011 its reverse (1103220212), we get a palindrome (3223443223).
The spelling of 2120223011 in words is "two billion, one hundred twenty million, two hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •