Base | Representation |
---|---|
bin | 111010101101011… |
… | …0100111101111001 |
3 | 12002021211200122121 |
4 | 1311122310331321 |
5 | 13013302420334 |
6 | 523251121241 |
7 | 66550304635 |
oct | 16532647571 |
9 | 5067750577 |
10 | 1969966969 |
11 | 920aa4383 |
12 | 46b8a3221 |
13 | 255190339 |
14 | 1498bbdc5 |
15 | b7e2ddb4 |
hex | 756b4f79 |
1969966969 has 2 divisors, whose sum is σ = 1969966970. Its totient is φ = 1969966968.
The previous prime is 1969966939. The next prime is 1969966991. The reversal of 1969966969 is 9696699691.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1750334569 + 219632400 = 41837^2 + 14820^2 .
It is a cyclic number.
It is not a de Polignac number, because 1969966969 - 223 = 1961578361 is a prime.
It is a super-2 number, since 2×19699669692 = 7761539717902093922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1969966898 and 1969966907.
It is not a weakly prime, because it can be changed into another prime (1969966909) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 984983484 + 984983485.
It is an arithmetic number, because the mean of its divisors is an integer number (984983485).
Almost surely, 21969966969 is an apocalyptic number.
It is an amenable number.
1969966969 is a deficient number, since it is larger than the sum of its proper divisors (1).
1969966969 is an equidigital number, since it uses as much as digits as its factorization.
1969966969 is an evil number, because the sum of its binary digits is even.
The product of its digits is 76527504, while the sum is 70.
The square root of 1969966969 is about 44384.3099416900. The cubic root of 1969966969 is about 1253.5826751275.
It can be divided in two parts, 19699 and 66969, that added together give a palindrome (86668).
The spelling of 1969966969 in words is "one billion, nine hundred sixty-nine million, nine hundred sixty-six thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •