Base | Representation |
---|---|
bin | 111100011111111… |
… | …1000101010110111 |
3 | 12020110211100110210 |
4 | 1320333320222313 |
5 | 13124140404421 |
6 | 533234120503 |
7 | 101206553400 |
oct | 17077705267 |
9 | 5213740423 |
10 | 2030013111 |
11 | 951986995 |
12 | 487a20133 |
13 | 2647552b9 |
14 | 15386c9a7 |
15 | bd340576 |
hex | 78ff8ab7 |
2030013111 has 12 divisors (see below), whose sum is σ = 3148591992. Its totient is φ = 1160007408.
The previous prime is 2030013109. The next prime is 2030013119. The reversal of 2030013111 is 1113100302.
It is not a de Polignac number, because 2030013111 - 21 = 2030013109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2030013119) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6904660 + ... + 6904953.
It is an arithmetic number, because the mean of its divisors is an integer number (262382666).
Almost surely, 22030013111 is an apocalyptic number.
2030013111 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2030013111 is a deficient number, since it is larger than the sum of its proper divisors (1118578881).
2030013111 is a wasteful number, since it uses less digits than its factorization.
2030013111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13809630 (or 13809623 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
The square root of 2030013111 is about 45055.6668023014. Note that the first 3 decimals coincide. The cubic root of 2030013111 is about 1266.1921429452.
Adding to 2030013111 its reverse (1113100302), we get a palindrome (3143113413).
It can be divided in two parts, 20300 and 13111, that added together give a triangular number (33411 = T258).
The spelling of 2030013111 in words is "two billion, thirty million, thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •