Base | Representation |
---|---|
bin | 100101110110001… |
… | …1100001100000001 |
3 | 10021111121200112121 |
4 | 1023230130030001 |
5 | 10100101102433 |
6 | 330003124241 |
7 | 43320214606 |
oct | 11354341401 |
9 | 3244550477 |
10 | 1269940993 |
11 | 5a1937512 |
12 | 2b5373681 |
13 | 173142199 |
14 | c09386ad |
15 | 76753c2d |
hex | 4bb1c301 |
1269940993 has 2 divisors, whose sum is σ = 1269940994. Its totient is φ = 1269940992.
The previous prime is 1269940921. The next prime is 1269941033. The reversal of 1269940993 is 3990499621.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1005650944 + 264290049 = 31712^2 + 16257^2 .
It is a cyclic number.
It is not a de Polignac number, because 1269940993 - 29 = 1269940481 is a prime.
It is a super-2 number, since 2×12699409932 = 3225500251403652098, 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 1269940993.
It is not a weakly prime, because it can be changed into another prime (1239940993) 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, 634970496 + 634970497.
It is an arithmetic number, because the mean of its divisors is an integer number (634970497).
Almost surely, 21269940993 is an apocalyptic number.
It is an amenable number.
1269940993 is a deficient number, since it is larger than the sum of its proper divisors (1).
1269940993 is an equidigital number, since it uses as much as digits as its factorization.
1269940993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 944784, while the sum is 52.
The square root of 1269940993 is about 35636.2314646204. The cubic root of 1269940993 is about 1082.9153607674.
The spelling of 1269940993 in words is "one billion, two hundred sixty-nine million, nine hundred forty thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •