Base | Representation |
---|---|
bin | 100011110010101… |
… | …1110011010001101 |
3 | 10002200220102210220 |
4 | 1013211132122031 |
5 | 4424424144341 |
6 | 315101421553 |
7 | 41522245602 |
oct | 10745363215 |
9 | 3080812726 |
10 | 1201006221 |
11 | 566a33828 |
12 | 29626a8b9 |
13 | 161a8748c |
14 | b57126a9 |
15 | 70688a66 |
hex | 4795e68d |
1201006221 has 8 divisors (see below), whose sum is σ = 1602572064. Its totient is φ = 800055600.
The previous prime is 1201006201. The next prime is 1201006229. The reversal of 1201006221 is 1226001021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1201006221 - 215 = 1200973453 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1201006221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201006229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 149230 + ... + 157071.
It is an arithmetic number, because the mean of its divisors is an integer number (200321508).
Almost surely, 21201006221 is an apocalyptic number.
It is an amenable number.
1201006221 is a deficient number, since it is larger than the sum of its proper divisors (401565843).
1201006221 is a wasteful number, since it uses less digits than its factorization.
1201006221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 307611.
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 1201006221 is about 34655.5366572212. The cubic root of 1201006221 is about 1062.9555054716.
Adding to 1201006221 its reverse (1226001021), we get a palindrome (2427007242).
The spelling of 1201006221 in words is "one billion, two hundred one million, six thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •