Base | Representation |
---|---|
bin | 110000011110010001011… |
… | …101100110101000001010 |
3 | 102210102222220122022210012 |
4 | 300132101131212220022 |
5 | 414033432232023424 |
6 | 11030131513551522 |
7 | 462442164526262 |
oct | 60362135465012 |
9 | 12712886568705 |
10 | 3331040111114 |
11 | 1074760336971 |
12 | 4596b27155a2 |
13 | 1b2167366061 |
14 | b731a6727a2 |
15 | 5b9abed2b0e |
hex | 30791766a0a |
3331040111114 has 8 divisors (see below), whose sum is σ = 5213801913120. Its totient is φ = 1593106140076.
The previous prime is 3331040111089. The next prime is 3331040111143. The reversal of 3331040111114 is 4111110401333.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×33310401111142 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a self number, because there is not a number n which added to its sum of digits gives 3331040111114.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36206957684 + ... + 36206957775.
It is an arithmetic number, because the mean of its divisors is an integer number (651725239140).
Almost surely, 23331040111114 is an apocalyptic number.
3331040111114 is a deficient number, since it is larger than the sum of its proper divisors (1882761802006).
3331040111114 is a wasteful number, since it uses less digits than its factorization.
3331040111114 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72413915484.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 3331040111114 its reverse (4111110401333), we get a palindrome (7442150512447).
The spelling of 3331040111114 in words is "three trillion, three hundred thirty-one billion, forty million, one hundred eleven thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •