Base | Representation |
---|---|
bin | 101011110110010000110… |
… | …010110011000110001001 |
3 | 101200001121011212022102211 |
4 | 223312100302303012021 |
5 | 343332014013410324 |
6 | 10224125013225121 |
7 | 430460636353435 |
oct | 53662062630611 |
9 | 11601534768384 |
10 | 3013201310089 |
11 | a61989649403 |
12 | 407b8b0321a1 |
13 | 18b1b38272a9 |
14 | a5ba82a59c5 |
15 | 535a86ad294 |
hex | 2bd90cb3189 |
3013201310089 has 2 divisors, whose sum is σ = 3013201310090. Its totient is φ = 3013201310088.
The previous prime is 3013201310087. The next prime is 3013201310143. The reversal of 3013201310089 is 9800131023103.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2235996855625 + 777204454464 = 1495325^2 + 881592^2 .
It is a cyclic number.
It is not a de Polignac number, because 3013201310089 - 21 = 3013201310087 is a prime.
Together with 3013201310087, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 3013201310089.
It is not a weakly prime, because it can be changed into another prime (3013201310087) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1506600655044 + 1506600655045.
It is an arithmetic number, because the mean of its divisors is an integer number (1506600655045).
Almost surely, 23013201310089 is an apocalyptic number.
It is an amenable number.
3013201310089 is a deficient number, since it is larger than the sum of its proper divisors (1).
3013201310089 is an equidigital number, since it uses as much as digits as its factorization.
3013201310089 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 31.
It can be divided in two parts, 3013 and 201310089, that added together give a palindrome (201313102).
The spelling of 3013201310089 in words is "three trillion, thirteen billion, two hundred one million, three hundred ten thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •