Base | Representation |
---|---|
bin | 1111010111011111… |
… | …0101010011100101 |
3 | 101122111000110112111 |
4 | 3311313311103211 |
5 | 31422003213211 |
6 | 1521154121021 |
7 | 204136245013 |
oct | 36567652345 |
9 | 11574013474 |
10 | 4125054181 |
11 | 1827538296 |
12 | 971580171 |
13 | 5097c7c81 |
14 | 2b1bc78b3 |
15 | 192228421 |
hex | f5df54e5 |
4125054181 has 2 divisors, whose sum is σ = 4125054182. Its totient is φ = 4125054180.
The previous prime is 4125054161. The next prime is 4125054247. The reversal of 4125054181 is 1814505214.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4027933156 + 97121025 = 63466^2 + 9855^2 .
It is a cyclic number.
It is not a de Polignac number, because 4125054181 - 25 = 4125054149 is a prime.
It is a super-2 number, since 2×41250541812 = 34032143992371161522, which contains 22 as substring.
It is an alternating number because its digits alternate between even and odd.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4125054151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2062527090 + 2062527091.
It is an arithmetic number, because the mean of its divisors is an integer number (2062527091).
Almost surely, 24125054181 is an apocalyptic number.
It is an amenable number.
4125054181 is a deficient number, since it is larger than the sum of its proper divisors (1).
4125054181 is an equidigital number, since it uses as much as digits as its factorization.
4125054181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6400, while the sum is 31.
The square root of 4125054181 is about 64226.5846904535. The cubic root of 4125054181 is about 1603.7741866810.
Adding to 4125054181 its reverse (1814505214), we get a palindrome (5939559395).
The spelling of 4125054181 in words is "four billion, one hundred twenty-five million, fifty-four thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •