Base | Representation |
---|---|
bin | 1001010000110111… |
… | …00111011010100101 |
3 | 110211121010120120002 |
4 | 10220123213122211 |
5 | 40141130422034 |
6 | 2141254551045 |
7 | 234146212055 |
oct | 45033473245 |
9 | 13747116502 |
10 | 4973295269 |
11 | 2122328388 |
12 | b69668485 |
13 | 61346b787 |
14 | 35270d565 |
15 | 1e192de7e |
hex | 1286e76a5 |
4973295269 has 2 divisors, whose sum is σ = 4973295270. Its totient is φ = 4973295268.
The previous prime is 4973295259. The next prime is 4973295281. The reversal of 4973295269 is 9625923794.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3879670369 + 1093624900 = 62287^2 + 33070^2 .
It is a cyclic number.
It is not a de Polignac number, because 4973295269 - 220 = 4972246693 is a prime.
It is a super-2 number, since 2×49732952692 = 49467331665315564722, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4973295259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2486647634 + 2486647635.
It is an arithmetic number, because the mean of its divisors is an integer number (2486647635).
Almost surely, 24973295269 is an apocalyptic number.
It is an amenable number.
4973295269 is a deficient number, since it is larger than the sum of its proper divisors (1).
4973295269 is an equidigital number, since it uses as much as digits as its factorization.
4973295269 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 7348320, while the sum is 56.
The square root of 4973295269 is about 70521.5943452784. The cubic root of 4973295269 is about 1706.9262142181.
The spelling of 4973295269 in words is "four billion, nine hundred seventy-three million, two hundred ninety-five thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •