Base | Representation |
---|---|
bin | 111110000000000… |
… | …011010100001001 |
3 | 2200111022200110211 |
4 | 332000003110021 |
5 | 4112242412334 |
6 | 251115041121 |
7 | 34530363613 |
oct | 7600032411 |
9 | 2614280424 |
10 | 1040200969 |
11 | 494191425 |
12 | 2504401a1 |
13 | 137674342 |
14 | 9c213db3 |
15 | 614c2a64 |
hex | 3e003509 |
1040200969 has 2 divisors, whose sum is σ = 1040200970. Its totient is φ = 1040200968.
The previous prime is 1040200957. The next prime is 1040201011. The reversal of 1040200969 is 9690020401.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 797215225 + 242985744 = 28235^2 + 15588^2 .
It is a cyclic number.
It is not a de Polignac number, because 1040200969 - 29 = 1040200457 is a prime.
It is a super-2 number, since 2×10402009692 = 2164036111817077922, 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 1040200969.
It is not a weakly prime, because it can be changed into another prime (1040200069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 520100484 + 520100485.
It is an arithmetic number, because the mean of its divisors is an integer number (520100485).
Almost surely, 21040200969 is an apocalyptic number.
It is an amenable number.
1040200969 is a deficient number, since it is larger than the sum of its proper divisors (1).
1040200969 is an equidigital number, since it uses as much as digits as its factorization.
1040200969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 31.
The square root of 1040200969 is about 32252.1467347524. The cubic root of 1040200969 is about 1013.2246603965.
The spelling of 1040200969 in words is "one billion, forty million, two hundred thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •