Base | Representation |
---|---|
bin | 110000001011101100111… |
… | …100000111101101011001 |
3 | 102201112112020210210011120 |
4 | 300023230330013231121 |
5 | 413222113100013423 |
6 | 11013033124115453 |
7 | 461135100430632 |
oct | 60135474075531 |
9 | 12645466723146 |
10 | 3311100001113 |
11 | 10672586a3113 |
12 | 455868835b89 |
13 | 1b030a1ca2b8 |
14 | b63882da889 |
15 | 5b1e1646ee3 |
hex | 302ecf07b59 |
3311100001113 has 8 divisors (see below), whose sum is σ = 4416710352576. Its totient is φ = 2206444825200.
The previous prime is 3311100001087. The next prime is 3311100001129. The reversal of 3311100001113 is 3111000011133.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3311100001113 - 25 = 3311100001081 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3311100001092 and 3311100001101.
It is not an unprimeable number, because it can be changed into a prime (3311100001193) 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, 238785798 + ... + 238799663.
It is an arithmetic number, because the mean of its divisors is an integer number (552088794072).
Almost surely, 23311100001113 is an apocalyptic number.
It is an amenable number.
3311100001113 is a deficient number, since it is larger than the sum of its proper divisors (1105610351463).
3311100001113 is a wasteful number, since it uses less digits than its factorization.
3311100001113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 477587775.
The product of its (nonzero) digits is 27, while the sum is 15.
Adding to 3311100001113 its reverse (3111000011133), we get a palindrome (6422100012246).
It can be divided in two parts, 3 and 311100001113, that multiplied together give a palindrome (933300003339).
The spelling of 3311100001113 in words is "three trillion, three hundred eleven billion, one hundred million, one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •