Base | Representation |
---|---|
bin | 1001100101010110… |
… | …00111110000001001 |
3 | 111021120110210021222 |
4 | 10302223013300021 |
5 | 41014123211131 |
6 | 2210314011425 |
7 | 241333620650 |
oct | 46253076011 |
9 | 14246423258 |
10 | 5145132041 |
11 | 2200324945 |
12 | bb7116b75 |
13 | 63cc44b3a |
14 | 36b480197 |
15 | 201a7387b |
hex | 132ac7c09 |
5145132041 has 4 divisors (see below), whose sum is σ = 5880150912. Its totient is φ = 4410113172.
The previous prime is 5145131983. The next prime is 5145132049. The reversal of 5145132041 is 1402315415.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5145132041 - 226 = 5078023177 is a prime.
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 5145132041.
It is not an unprimeable number, because it can be changed into a prime (5145132049) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 367509425 + ... + 367509438.
It is an arithmetic number, because the mean of its divisors is an integer number (1470037728).
Almost surely, 25145132041 is an apocalyptic number.
It is an amenable number.
5145132041 is a deficient number, since it is larger than the sum of its proper divisors (735018871).
5145132041 is an equidigital number, since it uses as much as digits as its factorization.
5145132041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 735018870.
The product of its (nonzero) digits is 2400, while the sum is 26.
The square root of 5145132041 is about 71729.5757759657. The cubic root of 5145132041 is about 1726.3632202092.
Adding to 5145132041 its reverse (1402315415), we get a palindrome (6547447456).
The spelling of 5145132041 in words is "five billion, one hundred forty-five million, one hundred thirty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •