Base | Representation |
---|---|
bin | 101011110110001011010… |
… | …110111110110110000101 |
3 | 101200001100211021222202022 |
4 | 223312023112332312011 |
5 | 343331322143211401 |
6 | 10224111555052525 |
7 | 430455451353416 |
oct | 53661326766605 |
9 | 11601324258668 |
10 | 3013110132101 |
11 | a61942132aa3 |
12 | 407b645a1145 |
13 | 18b19a982114 |
14 | a5b9a12d80d |
15 | 535a069c71b |
hex | 2bd8b5bed85 |
3013110132101 has 8 divisors (see below), whose sum is σ = 3020025687264. Its totient is φ = 3006195091120.
The previous prime is 3013110132059. The next prime is 3013110132121. The reversal of 3013110132101 is 1012310113103.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3013110132101 - 26 = 3013110132037 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3013110132101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3013110132121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13181555 + ... + 13408191.
It is an arithmetic number, because the mean of its divisors is an integer number (377503210908).
Almost surely, 23013110132101 is an apocalyptic number.
It is an amenable number.
3013110132101 is a deficient number, since it is larger than the sum of its proper divisors (6915555163).
3013110132101 is a wasteful number, since it uses less digits than its factorization.
3013110132101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257091.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 3013110132101 its reverse (1012310113103), we get a palindrome (4025420245204).
The spelling of 3013110132101 in words is "three trillion, thirteen billion, one hundred ten million, one hundred thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.088 sec. • engine limits •