Base | Representation |
---|---|
bin | 1001010111000110… |
… | …11000000111110111 |
3 | 110222020200001102120 |
4 | 10223203120013313 |
5 | 40243032131211 |
6 | 2150405211023 |
7 | 235353263100 |
oct | 45343300767 |
9 | 13866601376 |
10 | 5025661431 |
11 | 21499448aa |
12 | b83100a73 |
13 | 621274b7b |
14 | 3596613a7 |
15 | 1e6324d06 |
hex | 12b8d81f7 |
5025661431 has 24 divisors (see below), whose sum is σ = 8253431280. Its totient is φ = 2702875392.
The previous prime is 5025661411. The next prime is 5025661439. The reversal of 5025661431 is 1341665205.
It is not a de Polignac number, because 5025661431 - 217 = 5025530359 is a prime.
It is a super-2 number, since 2×50256614312 = 50514545638081935522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5025661392 and 5025661401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5025661439) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1003036 + ... + 1008033.
It is an arithmetic number, because the mean of its divisors is an integer number (343892970).
Almost surely, 25025661431 is an apocalyptic number.
5025661431 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
5025661431 is a deficient number, since it is larger than the sum of its proper divisors (3227769849).
5025661431 is a wasteful number, since it uses less digits than its factorization.
5025661431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2011103 (or 2011096 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 33.
The square root of 5025661431 is about 70891.8996148361. The cubic root of 5025661431 is about 1712.8963182837.
The spelling of 5025661431 in words is "five billion, twenty-five million, six hundred sixty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •