Base | Representation |
---|---|
bin | 111100000001100… |
… | …1110001100010001 |
3 | 12012100220102011111 |
4 | 1320003032030101 |
5 | 13111103013411 |
6 | 531505213321 |
7 | 100624441135 |
oct | 17003161421 |
9 | 5170812144 |
10 | 2014110481 |
11 | 943a05019 |
12 | 482631241 |
13 | 261377b66 |
14 | 1516cd3c5 |
15 | bbc4d721 |
hex | 780ce311 |
2014110481 has 2 divisors, whose sum is σ = 2014110482. Its totient is φ = 2014110480.
The previous prime is 2014110473. The next prime is 2014110509. The reversal of 2014110481 is 1840114102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1882778881 + 131331600 = 43391^2 + 11460^2 .
It is a cyclic number.
It is not a de Polignac number, because 2014110481 - 23 = 2014110473 is a prime.
It is a super-2 number, since 2×20141104812 = 8113282059348102722, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2014110401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1007055240 + 1007055241.
It is an arithmetic number, because the mean of its divisors is an integer number (1007055241).
Almost surely, 22014110481 is an apocalyptic number.
It is an amenable number.
2014110481 is a deficient number, since it is larger than the sum of its proper divisors (1).
2014110481 is an equidigital number, since it uses as much as digits as its factorization.
2014110481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 22.
The square root of 2014110481 is about 44878.8422421969. The cubic root of 2014110481 is about 1262.8771241571.
Adding to 2014110481 its reverse (1840114102), we get a palindrome (3854224583).
The spelling of 2014110481 in words is "two billion, fourteen million, one hundred ten thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •