Base | Representation |
---|---|
bin | 100011110010110… |
… | …0001110101011101 |
3 | 10002200221011001121 |
4 | 1013211201311131 |
5 | 4424430122003 |
6 | 315102010541 |
7 | 41522334526 |
oct | 10745416535 |
9 | 3080834047 |
10 | 1201020253 |
11 | 566a43324 |
12 | 296276a51 |
13 | 161a90994 |
14 | b571784d |
15 | 7068ccbd |
hex | 47961d5d |
1201020253 has 2 divisors, whose sum is σ = 1201020254. Its totient is φ = 1201020252.
The previous prime is 1201020211. The next prime is 1201020283. The reversal of 1201020253 is 3520201021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1180472164 + 20548089 = 34358^2 + 4533^2 .
It is an emirp because it is prime and its reverse (3520201021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1201020253 - 221 = 1198923101 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1201020203) 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, 600510126 + 600510127.
It is an arithmetic number, because the mean of its divisors is an integer number (600510127).
Almost surely, 21201020253 is an apocalyptic number.
It is an amenable number.
1201020253 is a deficient number, since it is larger than the sum of its proper divisors (1).
1201020253 is an equidigital number, since it uses as much as digits as its factorization.
1201020253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 1201020253 is about 34655.7391062433. The cubic root of 1201020253 is about 1062.9596451486.
Adding to 1201020253 its reverse (3520201021), we get a palindrome (4721221274).
The spelling of 1201020253 in words is "one billion, two hundred one million, twenty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •