Base | Representation |
---|---|
bin | 1001011011011110… |
… | …0001010111001001 |
3 | 20112101210002011200 |
4 | 2112313201113021 |
5 | 20140432340334 |
6 | 1055055014413 |
7 | 116503211034 |
oct | 22667412711 |
9 | 6471702150 |
10 | 2531136969 |
11 | 1089840739 |
12 | 5a780a409 |
13 | 314511aaa |
14 | 1a023801b |
15 | ec32b799 |
hex | 96de15c9 |
2531136969 has 12 divisors (see below), whose sum is σ = 3658667376. Its totient is φ = 1686233592.
The previous prime is 2531136947. The next prime is 2531136973. The reversal of 2531136969 is 9696311352.
It is not a de Polignac number, because 2531136969 - 27 = 2531136841 is a prime.
It is a super-2 number, since 2×25311369692 = 12813308711677013922, which contains 22 as substring.
It is a hoax number, since the sum of its digits (45) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (2531136869) 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 11 ways as a sum of consecutive naturals, for example, 85699 + ... + 111384.
It is an arithmetic number, because the mean of its divisors is an integer number (304888948).
Almost surely, 22531136969 is an apocalyptic number.
It is an amenable number.
2531136969 is a deficient number, since it is larger than the sum of its proper divisors (1127530407).
2531136969 is a wasteful number, since it uses less digits than its factorization.
2531136969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198516 (or 198513 counting only the distinct ones).
The product of its digits is 262440, while the sum is 45.
The square root of 2531136969 is about 50310.4061700957. The cubic root of 2531136969 is about 1362.8201587955.
The spelling of 2531136969 in words is "two billion, five hundred thirty-one million, one hundred thirty-six thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •