Base | Representation |
---|---|
bin | 1011101000001001… |
… | …1011101110001101 |
3 | 22001112002101111111 |
4 | 2322002123232031 |
5 | 22343011400023 |
6 | 1233414052021 |
7 | 140226522331 |
oct | 27202335615 |
9 | 8045071444 |
10 | 3121200013 |
11 | 1361921848 |
12 | 73134a011 |
13 | 3a983b719 |
14 | 2187557c1 |
15 | 13403500d |
hex | ba09bb8d |
3121200013 has 2 divisors, whose sum is σ = 3121200014. Its totient is φ = 3121200012.
The previous prime is 3121199971. The next prime is 3121200097. The reversal of 3121200013 is 3100021213.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2126869924 + 994330089 = 46118^2 + 31533^2 .
It is a cyclic number.
It is not a de Polignac number, because 3121200013 - 217 = 3121068941 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3121199966 and 3121200002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3121200113) 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, 1560600006 + 1560600007.
It is an arithmetic number, because the mean of its divisors is an integer number (1560600007).
Almost surely, 23121200013 is an apocalyptic number.
It is an amenable number.
3121200013 is a deficient number, since it is larger than the sum of its proper divisors (1).
3121200013 is an equidigital number, since it uses as much as digits as its factorization.
3121200013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 3121200013 is about 55867.7009818732. The cubic root of 3121200013 is about 1461.4160298438.
Adding to 3121200013 its reverse (3100021213), we get a palindrome (6221221226).
The spelling of 3121200013 in words is "three billion, one hundred twenty-one million, two hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •