Base | Representation |
---|---|
bin | 10000110001011110… |
… | …01001000101101001 |
3 | 212020120101122022222 |
4 | 20120233021011221 |
5 | 121420231231034 |
6 | 4045315123425 |
7 | 436102530131 |
oct | 103057110551 |
9 | 25216348288 |
10 | 9004945769 |
11 | 390106a046 |
12 | 18b38a3575 |
13 | b067c24a1 |
14 | 615d41ac1 |
15 | 37a85712e |
hex | 218bc9169 |
9004945769 has 2 divisors, whose sum is σ = 9004945770. Its totient is φ = 9004945768.
The previous prime is 9004945739. The next prime is 9004945841. The reversal of 9004945769 is 9675494009.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8908905769 + 96040000 = 94387^2 + 9800^2 .
It is an emirp because it is prime and its reverse (9675494009) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 9004945769 - 28 = 9004945513 is a prime.
It is a super-2 number, since 2×90049457692 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 9004945769.
It is not a weakly prime, because it can be changed into another prime (9004945739) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4502472884 + 4502472885.
It is an arithmetic number, because the mean of its divisors is an integer number (4502472885).
Almost surely, 29004945769 is an apocalyptic number.
It is an amenable number.
9004945769 is a deficient number, since it is larger than the sum of its proper divisors (1).
9004945769 is an equidigital number, since it uses as much as digits as its factorization.
9004945769 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2449440, while the sum is 53.
The square root of 9004945769 is about 94894.3927163244. The cubic root of 9004945769 is about 2080.4647760228.
The spelling of 9004945769 in words is "nine billion, four million, nine hundred forty-five thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •