Base | Representation |
---|---|
bin | 100011110010000… |
… | …1100001000010001 |
3 | 10002200021022111200 |
4 | 1013210030020101 |
5 | 4424332403301 |
6 | 315050301413 |
7 | 41516343204 |
oct | 10744141021 |
9 | 3080238450 |
10 | 1200669201 |
11 | 5668235a6 |
12 | 296127869 |
13 | 161999c64 |
14 | b566593b |
15 | 7061dc86 |
hex | 4790c211 |
1200669201 has 12 divisors (see below), whose sum is σ = 1752180612. Its totient is φ = 792193536.
The previous prime is 1200669193. The next prime is 1200669209. The reversal of 1200669201 is 1029660021.
It is an interprime number because it is at equal distance from previous prime (1200669193) and next prime (1200669209).
It can be written as a sum of positive squares in 2 ways, for example, as 951660801 + 249008400 = 30849^2 + 15780^2 .
It is not a de Polignac number, because 1200669201 - 23 = 1200669193 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1200669209) 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 in 11 ways as a sum of consecutive naturals, for example, 686796 + ... + 688541.
It is an arithmetic number, because the mean of its divisors is an integer number (146015051).
Almost surely, 21200669201 is an apocalyptic number.
It is an amenable number.
1200669201 is a deficient number, since it is larger than the sum of its proper divisors (551511411).
1200669201 is a wasteful number, since it uses less digits than its factorization.
1200669201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1375440 (or 1375437 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The square root of 1200669201 is about 34650.6738895508. The cubic root of 1200669201 is about 1062.8560691899.
The spelling of 1200669201 in words is "one billion, two hundred million, six hundred sixty-nine thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •