Base | Representation |
---|---|
bin | 111111010001101… |
… | …101011000111001 |
3 | 2201222121012222122 |
4 | 333101231120321 |
5 | 4133232410334 |
6 | 253201531025 |
7 | 35210340023 |
oct | 7721553071 |
9 | 2658535878 |
10 | 1061606969 |
11 | 4a5282035 |
12 | 257643a75 |
13 | 13bc2a707 |
14 | a0dc7013 |
15 | 6330032e |
hex | 3f46d639 |
1061606969 has 4 divisors (see below), whose sum is σ = 1117481040. Its totient is φ = 1005732900.
The previous prime is 1061606963. The next prime is 1061606993. The reversal of 1061606969 is 9696061601.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1061606969 - 228 = 793171513 is a prime.
It is a super-2 number, since 2×10616069692 = 2254018713258733922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1061606963) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27937007 + ... + 27937044.
It is an arithmetic number, because the mean of its divisors is an integer number (279370260).
Almost surely, 21061606969 is an apocalyptic number.
1061606969 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
1061606969 is a deficient number, since it is larger than the sum of its proper divisors (55874071).
1061606969 is an equidigital number, since it uses as much as digits as its factorization.
1061606969 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55874070.
The product of its (nonzero) digits is 104976, while the sum is 44.
The square root of 1061606969 is about 32582.3106761936. The cubic root of 1061606969 is about 1020.1278095002.
The spelling of 1061606969 in words is "one billion, sixty-one million, six hundred six thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •