Base | Representation |
---|---|
bin | 101011110110010000110… |
… | …101011011110011011001 |
3 | 101200001121020011102100022 |
4 | 223312100311123303121 |
5 | 343332014203013423 |
6 | 10224125040120225 |
7 | 430460645262203 |
oct | 53662065336331 |
9 | 11601536142308 |
10 | 3013202001113 |
11 | a61989a805a7 |
12 | 407b8b306075 |
13 | 18b1b3a09995 |
14 | a5ba8405773 |
15 | 535a8797dc8 |
hex | 2bd90d5bcd9 |
3013202001113 has 2 divisors, whose sum is σ = 3013202001114. Its totient is φ = 3013202001112.
The previous prime is 3013202001097. The next prime is 3013202001119. The reversal of 3013202001113 is 3111002023103.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3011099503504 + 2102497609 = 1735252^2 + 45853^2 .
It is a cyclic number.
It is not a de Polignac number, because 3013202001113 - 24 = 3013202001097 is a prime.
It is a super-2 number, since 2×30132020011132 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3013202001091 and 3013202001100.
It is not a weakly prime, because it can be changed into another prime (3013202001119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1506601000556 + 1506601000557.
It is an arithmetic number, because the mean of its divisors is an integer number (1506601000557).
Almost surely, 23013202001113 is an apocalyptic number.
It is an amenable number.
3013202001113 is a deficient number, since it is larger than the sum of its proper divisors (1).
3013202001113 is an equidigital number, since it uses as much as digits as its factorization.
3013202001113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 3013202001113 its reverse (3111002023103), we get a palindrome (6124204024216).
The spelling of 3013202001113 in words is "three trillion, thirteen billion, two hundred two million, one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •