Base | Representation |
---|---|
bin | 111100011111111… |
… | …1010100111111001 |
3 | 12020110211202110011 |
4 | 1320333322213321 |
5 | 13124141133423 |
6 | 533234221521 |
7 | 101206615621 |
oct | 17077724771 |
9 | 5213752404 |
10 | 2030021113 |
11 | 9519919aa |
12 | 487a248a1 |
13 | 264758b33 |
14 | 153871881 |
15 | bd342b0d |
hex | 78ffa9f9 |
2030021113 has 4 divisors (see below), whose sum is σ = 2030500468. Its totient is φ = 2029541760.
The previous prime is 2030021111. The next prime is 2030021117. The reversal of 2030021113 is 3111200302.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1315367824 + 714653289 = 36268^2 + 26733^2 .
It is a cyclic number.
It is not a de Polignac number, because 2030021113 - 21 = 2030021111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2030021093 and 2030021102.
It is not an unprimeable number, because it can be changed into a prime (2030021111) 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, 233268 + ... + 241813.
It is an arithmetic number, because the mean of its divisors is an integer number (507625117).
Almost surely, 22030021113 is an apocalyptic number.
It is an amenable number.
2030021113 is a deficient number, since it is larger than the sum of its proper divisors (479355).
2030021113 is an equidigital number, since it uses as much as digits as its factorization.
2030021113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 479354.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 2030021113 is about 45055.7556034742. The cubic root of 2030021113 is about 1266.1938066547.
Adding to 2030021113 its reverse (3111200302), we get a palindrome (5141221415).
The spelling of 2030021113 in words is "two billion, thirty million, twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •