Base | Representation |
---|---|
bin | 100100000001110… |
… | …1010101110001001 |
3 | 10010020210112210201 |
4 | 1020003222232021 |
5 | 4433440432334 |
6 | 315543212201 |
7 | 41646441634 |
oct | 11003525611 |
9 | 3106715721 |
10 | 1208920969 |
11 | 57044a243 |
12 | 298a47061 |
13 | 1635c8b69 |
14 | b67b2c1b |
15 | 711edc14 |
hex | 480eab89 |
1208920969 has 2 divisors, whose sum is σ = 1208920970. Its totient is φ = 1208920968.
The previous prime is 1208920907. The next prime is 1208920987. The reversal of 1208920969 is 9690298021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 965966400 + 242954569 = 31080^2 + 15587^2 .
It is an emirp because it is prime and its reverse (9690298021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1208920969 - 27 = 1208920841 is a prime.
It is a super-2 number, since 2×12089209692 = 2922979818575797922, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1208927969) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 604460484 + 604460485.
It is an arithmetic number, because the mean of its divisors is an integer number (604460485).
Almost surely, 21208920969 is an apocalyptic number.
It is an amenable number.
1208920969 is a deficient number, since it is larger than the sum of its proper divisors (1).
1208920969 is an equidigital number, since it uses as much as digits as its factorization.
1208920969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 139968, while the sum is 46.
The square root of 1208920969 is about 34769.5408223922. The cubic root of 1208920969 is about 1065.2853883357.
The spelling of 1208920969 in words is "one billion, two hundred eight million, nine hundred twenty thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •