Base | Representation |
---|---|
bin | 1001011100001110… |
… | …1001001111100101 |
3 | 20112121202112120211 |
4 | 2113003221033211 |
5 | 20142241034411 |
6 | 1055251055421 |
7 | 116542215262 |
oct | 22703511745 |
9 | 6477675524 |
10 | 2534314981 |
11 | 10906113a0 |
12 | 5a88a1571 |
13 | 315085483 |
14 | 1a0824269 |
15 | ec758221 |
hex | 970e93e5 |
2534314981 has 8 divisors (see below), whose sum is σ = 2910218400. Its totient is φ = 2182663440.
The previous prime is 2534314877. The next prime is 2534315011. The reversal of 2534314981 is 1894134352.
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 2534314981 - 211 = 2534312933 is a prime.
It is a super-2 number, since 2×25343149812 = 12845504845842060722, 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 (2534314681) 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, 6062746 + ... + 6063163.
It is an arithmetic number, because the mean of its divisors is an integer number (363777300).
Almost surely, 22534314981 is an apocalyptic number.
It is an amenable number.
2534314981 is a deficient number, since it is larger than the sum of its proper divisors (375903419).
2534314981 is a wasteful number, since it uses less digits than its factorization.
2534314981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12125939.
The product of its digits is 103680, while the sum is 40.
The square root of 2534314981 is about 50341.9803047119. The cubic root of 2534314981 is about 1363.3902909126.
The spelling of 2534314981 in words is "two billion, five hundred thirty-four million, three hundred fourteen thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •