Base | Representation |
---|---|
bin | 1111101111111010… |
… | …1000100001100011 |
3 | 101220121210020221221 |
4 | 3323332220201203 |
5 | 32124220001011 |
6 | 1535253555511 |
7 | 206522105161 |
oct | 37376504143 |
9 | 11817706857 |
10 | 4227500131 |
11 | 187a34a468 |
12 | 99b945b97 |
13 | 524ab6b8a |
14 | 2c1654231 |
15 | 19b212971 |
hex | fbfa8863 |
4227500131 has 2 divisors, whose sum is σ = 4227500132. Its totient is φ = 4227500130.
The previous prime is 4227500111. The next prime is 4227500191. The reversal of 4227500131 is 1310057224.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 4227500131 - 219 = 4226975843 is a prime.
It is a super-2 number, since 2×42275001312 = 35743514715210034322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4227500096 and 4227500105.
It is not a weakly prime, because it can be changed into another prime (4227500111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2113750065 + 2113750066.
It is an arithmetic number, because the mean of its divisors is an integer number (2113750066).
Almost surely, 24227500131 is an apocalyptic number.
4227500131 is a deficient number, since it is larger than the sum of its proper divisors (1).
4227500131 is an equidigital number, since it uses as much as digits as its factorization.
4227500131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1680, while the sum is 25.
The square root of 4227500131 is about 65019.2289326781. The cubic root of 4227500131 is about 1616.9423770721.
Adding to 4227500131 its reverse (1310057224), we get a palindrome (5537557355).
The spelling of 4227500131 in words is "four billion, two hundred twenty-seven million, five hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •