Base | Representation |
---|---|
bin | 1001011000100010… |
… | …11101010010101111 |
3 | 111000002101202210120 |
4 | 10230101131102233 |
5 | 40304130204411 |
6 | 2151520140023 |
7 | 235561044135 |
oct | 45421352257 |
9 | 14002352716 |
10 | 5037741231 |
11 | 2155745606 |
12 | b87167613 |
13 | 623914293 |
14 | 35b0c7755 |
15 | 1e740e106 |
hex | 12c45d4af |
5037741231 has 8 divisors (see below), whose sum is σ = 6745817520. Its totient is φ = 3344079552.
The previous prime is 5037741209. The next prime is 5037741259. The reversal of 5037741231 is 1321477305.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5037741231 - 25 = 5037741199 is a prime.
It is a super-2 number, since 2×50377412312 = 50757673421034790722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5037741192 and 5037741201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5037740231) 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, 3602836 + ... + 3604233.
It is an arithmetic number, because the mean of its divisors is an integer number (843227190).
Almost surely, 25037741231 is an apocalyptic number.
5037741231 is a deficient number, since it is larger than the sum of its proper divisors (1708076289).
5037741231 is a wasteful number, since it uses less digits than its factorization.
5037741231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7207305.
The product of its (nonzero) digits is 17640, while the sum is 33.
The square root of 5037741231 is about 70977.0472124616. The cubic root of 5037741231 is about 1714.2676063673.
The spelling of 5037741231 in words is "five billion, thirty-seven million, seven hundred forty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •