Base | Representation |
---|---|
bin | 111011111111111… |
… | …0000001010000111 |
3 | 12012022012012122011 |
4 | 1313333300022013 |
5 | 13110334413111 |
6 | 531433515051 |
7 | 100613632522 |
oct | 16777601207 |
9 | 5168165564 |
10 | 2013201031 |
11 | 943443806 |
12 | 482272a87 |
13 | 261119c1a |
14 | 151533bb9 |
15 | bbb1e021 |
hex | 77ff0287 |
2013201031 has 4 divisors (see below), whose sum is σ = 2119159000. Its totient is φ = 1907243064.
The previous prime is 2013200999. The next prime is 2013201037. The reversal of 2013201031 is 1301023102.
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 2013201031 - 25 = 2013200999 is a prime.
It is a super-2 number, since 2×20132010312 = 8105956782438925922, 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 (2013201037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52978956 + ... + 52978993.
It is an arithmetic number, because the mean of its divisors is an integer number (529789750).
Almost surely, 22013201031 is an apocalyptic number.
2013201031 is a deficient number, since it is larger than the sum of its proper divisors (105957969).
2013201031 is a wasteful number, since it uses less digits than its factorization.
2013201031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105957968.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 2013201031 is about 44868.7088180616. The cubic root of 2013201031 is about 1262.6870159973.
Adding to 2013201031 its reverse (1301023102), we get a palindrome (3314224133).
The spelling of 2013201031 in words is "two billion, thirteen million, two hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •