Base | Representation |
---|---|
bin | 1010010000001010… |
… | …0011100000001011 |
3 | 21002210121211220201 |
4 | 2210002203200023 |
5 | 21114021230011 |
6 | 1133031433031 |
7 | 125125513516 |
oct | 24402434013 |
9 | 7083554821 |
10 | 2752133131 |
11 | 11925643a0 |
12 | 649825777 |
13 | 34b23aa57 |
14 | 1c1723d7d |
15 | 111931cc1 |
hex | a40a380b |
2752133131 has 16 divisors (see below), whose sum is σ = 3033262080. Its totient is φ = 2476271680.
The previous prime is 2752133123. The next prime is 2752133177. The reversal of 2752133131 is 1313312572.
It is a cyclic number.
It is not a de Polignac number, because 2752133131 - 23 = 2752133123 is a prime.
It is a super-2 number, since 2×27521331312 = 15148473541495726322, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2752133131.
It is not an unprimeable number, because it can be changed into a prime (2752133231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 538470 + ... + 543556.
It is an arithmetic number, because the mean of its divisors is an integer number (189578880).
Almost surely, 22752133131 is an apocalyptic number.
2752133131 is a deficient number, since it is larger than the sum of its proper divisors (281128949).
2752133131 is a wasteful number, since it uses less digits than its factorization.
2752133131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5594.
The product of its digits is 3780, while the sum is 28.
The square root of 2752133131 is about 52460.7770720183. Note that the first 3 decimals coincide. The cubic root of 2752133131 is about 1401.3818212170.
The spelling of 2752133131 in words is "two billion, seven hundred fifty-two million, one hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •