Base | Representation |
---|---|
bin | 100101000001010… |
… | …0111100111111001 |
3 | 10012120102022211111 |
4 | 1022002213213321 |
5 | 10021000404234 |
6 | 323132400321 |
7 | 42532350001 |
oct | 11202474771 |
9 | 3176368744 |
10 | 1242200569 |
11 | 58820a745 |
12 | 2a80160a1 |
13 | 16a47b82c |
14 | bad97001 |
15 | 740c4664 |
hex | 4a0a79f9 |
1242200569 has 6 divisors (see below), whose sum is σ = 1261022154. Its totient is φ = 1223655840.
The previous prime is 1242200567. The next prime is 1242200579. The reversal of 1242200569 is 9650022421.
It can be written as a sum of positive squares in only one way, i.e., 929335225 + 312865344 = 30485^2 + 17688^2 .
It is not a de Polignac number, because 1242200569 - 21 = 1242200567 is a prime.
It is a super-2 number, since 2×12422005692 = 3086124507247847522, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1242200569.
It is not an unprimeable number, because it can be changed into a prime (1242200567) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 133872 + ... + 142849.
It is an arithmetic number, because the mean of its divisors is an integer number (210170359).
Almost surely, 21242200569 is an apocalyptic number.
It is an amenable number.
1242200569 is a deficient number, since it is larger than the sum of its proper divisors (18821585).
1242200569 is an frugal number, since it uses more digits than its factorization.
1242200569 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 276855 (or 276788 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 31.
The square root of 1242200569 is about 35244.8658530572. The cubic root of 1242200569 is about 1074.9722203746.
The spelling of 1242200569 in words is "one billion, two hundred forty-two million, two hundred thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •