Base | Representation |
---|---|
bin | 1010000111010101… |
… | …0001010001000011 |
3 | 21000012221011200222 |
4 | 2201311101101003 |
5 | 21030031034011 |
6 | 1125225533255 |
7 | 124165636106 |
oct | 24165212103 |
9 | 7005834628 |
10 | 2715096131 |
11 | 1173667a00 |
12 | 63934422b |
13 | 343670a77 |
14 | 1ba84273d |
15 | 10d567ddb |
hex | a1d51443 |
2715096131 has 12 divisors (see below), whose sum is σ = 2985799992. Its totient is φ = 2467080000.
The previous prime is 2715096127. The next prime is 2715096173. The reversal of 2715096131 is 1316905172.
It is not a de Polignac number, because 2715096131 - 22 = 2715096127 is a prime.
It is a super-2 number, since 2×27150961312 = 14743494001142338322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2715096091 and 2715096100.
It is not an unprimeable number, because it can be changed into a prime (2715096121) 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 in 11 ways as a sum of consecutive naturals, for example, 334916 + ... + 342926.
It is an arithmetic number, because the mean of its divisors is an integer number (248816666).
Almost surely, 22715096131 is an apocalyptic number.
2715096131 is a deficient number, since it is larger than the sum of its proper divisors (270703861).
2715096131 is a wasteful number, since it uses less digits than its factorization.
2715096131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10834 (or 10823 counting only the distinct ones).
The product of its (nonzero) digits is 11340, while the sum is 35.
The square root of 2715096131 is about 52106.5843344198. The cubic root of 2715096131 is about 1395.0670147617.
The spelling of 2715096131 in words is "two billion, seven hundred fifteen million, ninety-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •