Base | Representation |
---|---|
bin | 1001001000100001… |
… | …01101111010111101 |
3 | 110122201110221112011 |
4 | 10210100231322331 |
5 | 40020223020334 |
6 | 2130315211221 |
7 | 232336420123 |
oct | 44420557275 |
9 | 13581427464 |
10 | 4903329469 |
11 | 2096890005 |
12 | b4a146b11 |
13 | 601b126ac |
14 | 3472d9913 |
15 | 1da70d564 |
hex | 12442debd |
4903329469 has 2 divisors, whose sum is σ = 4903329470. Its totient is φ = 4903329468.
The previous prime is 4903329391. The next prime is 4903329491. The reversal of 4903329469 is 9649233094.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3964213444 + 939116025 = 62962^2 + 30645^2 .
It is a cyclic number.
It is not a de Polignac number, because 4903329469 - 219 = 4902805181 is a prime.
It is a super-2 number, since 2×49033294692 = 48085279763127643922, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4903329169) 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, 2451664734 + 2451664735.
It is an arithmetic number, because the mean of its divisors is an integer number (2451664735).
Almost surely, 24903329469 is an apocalyptic number.
It is an amenable number.
4903329469 is a deficient number, since it is larger than the sum of its proper divisors (1).
4903329469 is an equidigital number, since it uses as much as digits as its factorization.
4903329469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1259712, while the sum is 49.
The square root of 4903329469 is about 70023.7778829449. Note that the first 3 decimals coincide. The cubic root of 4903329469 is about 1698.8838658636.
The spelling of 4903329469 in words is "four billion, nine hundred three million, three hundred twenty-nine thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •