Base | Representation |
---|---|
bin | 111111100010011… |
… | …011011100100001 |
3 | 2202021211220021012 |
4 | 333202123130201 |
5 | 4140343134141 |
6 | 253435510305 |
7 | 35262523223 |
oct | 7742333441 |
9 | 2667756235 |
10 | 1065989921 |
11 | 4a77a6007 |
12 | 258bb8395 |
13 | 13cb03689 |
14 | a1808413 |
15 | 638b8ceb |
hex | 3f89b721 |
1065989921 has 2 divisors, whose sum is σ = 1065989922. Its totient is φ = 1065989920.
The previous prime is 1065989893. The next prime is 1065989941. The reversal of 1065989921 is 1299895601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1001026321 + 64963600 = 31639^2 + 8060^2 .
It is a cyclic number.
It is not a de Polignac number, because 1065989921 - 26 = 1065989857 is a prime.
It is a super-2 number, since 2×10659899212 = 2272669023347172482, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1065989921.
It is not a weakly prime, because it can be changed into another prime (1065989941) 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, 532994960 + 532994961.
It is an arithmetic number, because the mean of its divisors is an integer number (532994961).
Almost surely, 21065989921 is an apocalyptic number.
It is an amenable number.
1065989921 is a deficient number, since it is larger than the sum of its proper divisors (1).
1065989921 is an equidigital number, since it uses as much as digits as its factorization.
1065989921 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 349920, while the sum is 50.
The square root of 1065989921 is about 32649.5010834775. The cubic root of 1065989921 is about 1021.5297822328.
The spelling of 1065989921 in words is "one billion, sixty-five million, nine hundred eighty-nine thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •