Base | Representation |
---|---|
bin | 100110110101011… |
… | …1101001010011001 |
3 | 10100211000122122122 |
4 | 1031222331022121 |
5 | 10132043344301 |
6 | 333150031025 |
7 | 44202135305 |
oct | 11552751231 |
9 | 3324018578 |
10 | 1303106201 |
11 | 609629a81 |
12 | 3044a8475 |
13 | 179c84a77 |
14 | c50ccd05 |
15 | 7960581b |
hex | 4dabd299 |
1303106201 has 2 divisors, whose sum is σ = 1303106202. Its totient is φ = 1303106200.
The previous prime is 1303106197. The next prime is 1303106237. The reversal of 1303106201 is 1026013031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1200691801 + 102414400 = 34651^2 + 10120^2 .
It is a cyclic number.
It is not a de Polignac number, because 1303106201 - 22 = 1303106197 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1303106201.
It is not a weakly prime, because it can be changed into another prime (1303106261) 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 as a sum of consecutive naturals, namely, 651553100 + 651553101.
It is an arithmetic number, because the mean of its divisors is an integer number (651553101).
Almost surely, 21303106201 is an apocalyptic number.
It is an amenable number.
1303106201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1303106201 is an equidigital number, since it uses as much as digits as its factorization.
1303106201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 1303106201 is about 36098.5623120922. The cubic root of 1303106201 is about 1092.2614443866.
Adding to 1303106201 its reverse (1026013031), we get a palindrome (2329119232).
The spelling of 1303106201 in words is "one billion, three hundred three million, one hundred six thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •