Base | Representation |
---|---|
bin | 1011111011001101… |
… | …0100001100101001 |
3 | 22021002110220101022 |
4 | 2332303110030221 |
5 | 23023441414423 |
6 | 1245351102225 |
7 | 142220045306 |
oct | 27663241451 |
9 | 8232426338 |
10 | 3201123113 |
11 | 13a2a501a1 |
12 | 754071975 |
13 | 3c0272ab6 |
14 | 2251dc0ad |
15 | 13b070dc8 |
hex | becd4329 |
3201123113 has 2 divisors, whose sum is σ = 3201123114. Its totient is φ = 3201123112.
The previous prime is 3201123067. The next prime is 3201123143. The reversal of 3201123113 is 3113211023.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2842702489 + 358420624 = 53317^2 + 18932^2 .
It is a cyclic number.
It is not a de Polignac number, because 3201123113 - 28 = 3201122857 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3201123091 and 3201123100.
It is not a weakly prime, because it can be changed into another prime (3201123143) 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, 1600561556 + 1600561557.
It is an arithmetic number, because the mean of its divisors is an integer number (1600561557).
Almost surely, 23201123113 is an apocalyptic number.
It is an amenable number.
3201123113 is a deficient number, since it is larger than the sum of its proper divisors (1).
3201123113 is an equidigital number, since it uses as much as digits as its factorization.
3201123113 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 3201123113 is about 56578.4686342782. The cubic root of 3201123113 is about 1473.7849786105.
Adding to 3201123113 its reverse (3113211023), we get a palindrome (6314334136).
The spelling of 3201123113 in words is "three billion, two hundred one million, one hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.144 sec. • engine limits •