Base | Representation |
---|---|
bin | 111111101111001… |
… | …111111011110001 |
3 | 2202112011122022022 |
4 | 333233033323301 |
5 | 4142223210031 |
6 | 254035521225 |
7 | 35333221232 |
oct | 7757177361 |
9 | 2675148268 |
10 | 1069350641 |
11 | 4a9690a67 |
12 | 25a159215 |
13 | 14070c278 |
14 | a2041089 |
15 | 63d2e97b |
hex | 3fbcfef1 |
1069350641 has 2 divisors, whose sum is σ = 1069350642. Its totient is φ = 1069350640.
The previous prime is 1069350613. The next prime is 1069350683. The reversal of 1069350641 is 1460539601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 867597025 + 201753616 = 29455^2 + 14204^2 .
It is a cyclic number.
It is not a de Polignac number, because 1069350641 - 26 = 1069350577 is a prime.
It is a super-2 number, since 2×10693506412 = 2287021586814221762, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1069350691) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 534675320 + 534675321.
It is an arithmetic number, because the mean of its divisors is an integer number (534675321).
Almost surely, 21069350641 is an apocalyptic number.
It is an amenable number.
1069350641 is a deficient number, since it is larger than the sum of its proper divisors (1).
1069350641 is an equidigital number, since it uses as much as digits as its factorization.
1069350641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19440, while the sum is 35.
The square root of 1069350641 is about 32700.9272192701. The cubic root of 1069350641 is about 1022.6021732617.
The spelling of 1069350641 in words is "one billion, sixty-nine million, three hundred fifty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •