Base | Representation |
---|---|
bin | 1001001110000111… |
… | …00111000010000111 |
3 | 110202222201111010211 |
4 | 10213003213002013 |
5 | 40114224200111 |
6 | 2135112300251 |
7 | 233446134643 |
oct | 44703470207 |
9 | 13688644124 |
10 | 4950225031 |
11 | 2110300374 |
12 | b619a1687 |
13 | 60b751a4b |
14 | 34d625c23 |
15 | 1de8c3521 |
hex | 1270e7087 |
4950225031 has 2 divisors, whose sum is σ = 4950225032. Its totient is φ = 4950225030.
The previous prime is 4950225017. The next prime is 4950225041. The reversal of 4950225031 is 1305220594.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 4950225031 - 227 = 4816007303 is a prime.
It is a super-2 number, since 2×49502250312 = 49009455715077901922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4950224984 and 4950225002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4950225041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2475112515 + 2475112516.
It is an arithmetic number, because the mean of its divisors is an integer number (2475112516).
Almost surely, 24950225031 is an apocalyptic number.
4950225031 is a deficient number, since it is larger than the sum of its proper divisors (1).
4950225031 is an equidigital number, since it uses as much as digits as its factorization.
4950225031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 31.
The square root of 4950225031 is about 70357.8356048564. The cubic root of 4950225031 is about 1704.2827460997.
The spelling of 4950225031 in words is "four billion, nine hundred fifty million, two hundred twenty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •