Base | Representation |
---|---|
bin | 101011110110010000111… |
… | …001101010110001011001 |
3 | 101200001121022020210211021 |
4 | 223312100321222301121 |
5 | 343332014444023001 |
6 | 10224125120002441 |
7 | 430460660564056 |
oct | 53662071526131 |
9 | 11601538223737 |
10 | 3013203111001 |
11 | a6198a669466 |
12 | 407b8b760421 |
13 | 18b1b4007c15 |
14 | a5ba861402d |
15 | 535a8916ba1 |
hex | 2bd90e6ac59 |
3013203111001 has 4 divisors (see below), whose sum is σ = 3021070482432. Its totient is φ = 3005335739572.
The previous prime is 3013203110947. The next prime is 3013203111013. The reversal of 3013203111001 is 1001113023103.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3013203111001 is a prime.
It is a super-2 number, since 2×30132031110012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3013213111001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3933685141 + ... + 3933685906.
It is an arithmetic number, because the mean of its divisors is an integer number (755267620608).
Almost surely, 23013203111001 is an apocalyptic number.
It is an amenable number.
3013203111001 is a deficient number, since it is larger than the sum of its proper divisors (7867371431).
3013203111001 is an equidigital number, since it uses as much as digits as its factorization.
3013203111001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7867371430.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 3013203111001 its reverse (1001113023103), we get a palindrome (4014316134104).
The spelling of 3013203111001 in words is "three trillion, thirteen billion, two hundred three million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •