Base | Representation |
---|---|
bin | 111100000001101… |
… | …0011001110111011 |
3 | 12012100221110111022 |
4 | 1320003103032323 |
5 | 13111104144011 |
6 | 531505453055 |
7 | 100624555265 |
oct | 17003231673 |
9 | 5170843438 |
10 | 2014131131 |
11 | 943a19591 |
12 | 48264118b |
13 | 26138438c |
14 | 1516d6b35 |
15 | bbc548db |
hex | 780d33bb |
2014131131 has 4 divisors (see below), whose sum is σ = 2015153952. Its totient is φ = 2013108312.
The previous prime is 2014131121. The next prime is 2014131173. The reversal of 2014131131 is 1311314102.
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 2014131131 - 222 = 2009936827 is a prime.
It is a super-2 number, since 2×20141311312 = 8113448425726678322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2014131121) 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 3 ways as a sum of consecutive naturals, for example, 508451 + ... + 512396.
It is an arithmetic number, because the mean of its divisors is an integer number (503788488).
Almost surely, 22014131131 is an apocalyptic number.
2014131131 is a deficient number, since it is larger than the sum of its proper divisors (1022821).
2014131131 is a wasteful number, since it uses less digits than its factorization.
2014131131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1022820.
The product of its (nonzero) digits is 72, while the sum is 17.
The square root of 2014131131 is about 44879.0723054744. The cubic root of 2014131131 is about 1262.8814400944.
Adding to 2014131131 its reverse (1311314102), we get a palindrome (3325445233).
The spelling of 2014131131 in words is "two billion, fourteen million, one hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •