Base | Representation |
---|---|
bin | 101011110111010010111… |
… | …001010011000100111001 |
3 | 101200011110110122100121001 |
4 | 223313102321103010321 |
5 | 343341301414411301 |
6 | 10224431031045001 |
7 | 430530263613061 |
oct | 53672271230471 |
9 | 11604413570531 |
10 | 3014310310201 |
11 | a623a8650623 |
12 | 40823a510761 |
13 | 18b32c509688 |
14 | a5c716a83a1 |
15 | 53620c20c01 |
hex | 2bdd2e53139 |
3014310310201 has 2 divisors, whose sum is σ = 3014310310202. Its totient is φ = 3014310310200.
The previous prime is 3014310310199. The next prime is 3014310310211. The reversal of 3014310310201 is 1020130134103.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2462313318976 + 551996991225 = 1569176^2 + 742965^2 .
It is a cyclic number.
It is not a de Polignac number, because 3014310310201 - 21 = 3014310310199 is a prime.
Together with 3014310310199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (3014310310211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1507155155100 + 1507155155101.
It is an arithmetic number, because the mean of its divisors is an integer number (1507155155101).
Almost surely, 23014310310201 is an apocalyptic number.
It is an amenable number.
3014310310201 is a deficient number, since it is larger than the sum of its proper divisors (1).
3014310310201 is an equidigital number, since it uses as much as digits as its factorization.
3014310310201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 3014310310201 its reverse (1020130134103), we get a palindrome (4034440444304).
The spelling of 3014310310201 in words is "three trillion, fourteen billion, three hundred ten million, three hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •