Base | Representation |
---|---|
bin | 101011110100011001100… |
… | …100010000110110101001 |
3 | 101122212102202221121002120 |
4 | 223310121210100312221 |
5 | 343313414424323423 |
6 | 10223154320021453 |
7 | 430360240165131 |
oct | 53643144206651 |
9 | 11585382847076 |
10 | 3011201011113 |
11 | a61052518159 |
12 | 407711161889 |
13 | 18ac552a6b29 |
14 | a5a5876dac1 |
15 | 534dcc8bee3 |
hex | 2bd19910da9 |
3011201011113 has 8 divisors (see below), whose sum is σ = 4108305255648. Its totient is φ = 1960782053664.
The previous prime is 3011201011109. The next prime is 3011201011127. The reversal of 3011201011113 is 3111101021103.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3011201011113 - 22 = 3011201011109 is a prime.
It is a super-4 number, since 4×30112010111134 (a number of 51 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3011201011092 and 3011201011101.
It is not an unprimeable number, because it can be changed into a prime (3011201091113) 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, 11671321620 + ... + 11671321877.
It is an arithmetic number, because the mean of its divisors is an integer number (513538156956).
Almost surely, 23011201011113 is an apocalyptic number.
It is an amenable number.
3011201011113 is a deficient number, since it is larger than the sum of its proper divisors (1097104244535).
3011201011113 is a wasteful number, since it uses less digits than its factorization.
3011201011113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23342643543.
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 3011201011113 its reverse (3111101021103), we get a palindrome (6122302032216).
The spelling of 3011201011113 in words is "three trillion, eleven billion, two hundred one million, eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •