Base | Representation |
---|---|
bin | 111100100000010… |
… | …0110100100010111 |
3 | 12020111011220100202 |
4 | 1321000212210113 |
5 | 13124212413421 |
6 | 533242131115 |
7 | 101211265451 |
oct | 17100464427 |
9 | 5214156322 |
10 | 2030201111 |
11 | 951aa5164 |
12 | 487ab0a9b |
13 | 2647bca43 |
14 | 1538bb2d1 |
15 | bd37b10b |
hex | 79026917 |
2030201111 has 4 divisors (see below), whose sum is σ = 2038625424. Its totient is φ = 2021776800.
The previous prime is 2030201087. The next prime is 2030201113. The reversal of 2030201111 is 1111020302.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2030201111 is a prime.
It is a super-2 number, since 2×20302011112 = 8243433102211268642, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2030201092 and 2030201101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2030201113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4211795 + ... + 4212276.
It is an arithmetic number, because the mean of its divisors is an integer number (509656356).
Almost surely, 22030201111 is an apocalyptic number.
2030201111 is a deficient number, since it is larger than the sum of its proper divisors (8424313).
2030201111 is an equidigital number, since it uses as much as digits as its factorization.
2030201111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8424312.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 2030201111 is about 45057.7530620425. The cubic root of 2030201111 is about 1266.2312291911.
Adding to 2030201111 its reverse (1111020302), we get a palindrome (3141221413).
The spelling of 2030201111 in words is "two billion, thirty million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •