Base | Representation |
---|---|
bin | 111011111111100… |
… | …0100000001000111 |
3 | 12012021212000121212 |
4 | 1313333010001013 |
5 | 13110313121411 |
6 | 531430002035 |
7 | 100612250435 |
oct | 16777040107 |
9 | 5167760555 |
10 | 2013020231 |
11 | 94332a992 |
12 | 4821a631b |
13 | 261085841 |
14 | 1514c7d55 |
15 | bbad568b |
hex | 77fc4047 |
2013020231 has 8 divisors (see below), whose sum is σ = 2030860800. Its totient is φ = 1995211008.
The previous prime is 2013020161. The next prime is 2013020263. The reversal of 2013020231 is 1320203102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2013020231 - 210 = 2013019207 is a prime.
It is a super-2 number, since 2×20130202312 = 8104500900830586722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2013028231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 132095 + ... + 146543.
It is an arithmetic number, because the mean of its divisors is an integer number (253857600).
Almost surely, 22013020231 is an apocalyptic number.
2013020231 is a deficient number, since it is larger than the sum of its proper divisors (17840569).
2013020231 is a wasteful number, since it uses less digits than its factorization.
2013020231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15673.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 2013020231 is about 44866.6940056876. The cubic root of 2013020231 is about 1262.6492153929.
Adding to 2013020231 its reverse (1320203102), we get a palindrome (3333223333).
The spelling of 2013020231 in words is "two billion, thirteen million, twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •