Base | Representation |
---|---|
bin | 101011110100010011101… |
… | …110011000101011100001 |
3 | 101122212011221112011220222 |
4 | 223310103232120223201 |
5 | 343313214332020223 |
6 | 10223140455212425 |
7 | 430354640132231 |
oct | 53642356305341 |
9 | 11585157464828 |
10 | 3011103001313 |
11 | a61002165a20 |
12 | 4076a4377115 |
13 | 18ac3abac174 |
14 | a5a49739cc1 |
15 | 534d437c0c8 |
hex | 2bd13b98ae1 |
3011103001313 has 4 divisors (see below), whose sum is σ = 3284839637808. Its totient is φ = 2737366364820.
The previous prime is 3011103001307. The next prime is 3011103001399. The reversal of 3011103001313 is 3131003011103.
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 not a de Polignac number, because 3011103001313 - 222 = 3011098807009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3011103001291 and 3011103001300.
It is not an unprimeable number, because it can be changed into a prime (3011103081313) 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, 136868318231 + ... + 136868318252.
It is an arithmetic number, because the mean of its divisors is an integer number (821209909452).
Almost surely, 23011103001313 is an apocalyptic number.
It is an amenable number.
3011103001313 is a deficient number, since it is larger than the sum of its proper divisors (273736636495).
3011103001313 is a wasteful number, since it uses less digits than its factorization.
3011103001313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 273736636494.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 3011103001313 its reverse (3131003011103), we get a palindrome (6142106012416).
The spelling of 3011103001313 in words is "three trillion, eleven billion, one hundred three million, one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •