Base | Representation |
---|---|
bin | 1001011001010010101011… |
… | …1001110000100100100111 |
3 | 1100120112211112222020212212 |
4 | 2112110222321300210213 |
5 | 2323222034212143421 |
6 | 33545331223234035 |
7 | 2114216623224320 |
oct | 226245271604447 |
9 | 40515745866785 |
10 | 10330116131111 |
11 | 3322a83283377 |
12 | 11aa066ba891b |
13 | 59c18342014a |
14 | 279da1ca9447 |
15 | 12da9b519e5b |
hex | 9652ae70927 |
10330116131111 has 8 divisors (see below), whose sum is σ = 11809757546880. Its totient is φ = 8851452350328.
The previous prime is 10330116131047. The next prime is 10330116131113. The reversal of 10330116131111 is 11113161103301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10330116131111 - 26 = 10330116131047 is a prime.
It is a super-2 number, since 2×103301161311112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10330116131113) 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, 244386101 + ... + 244428366.
It is an arithmetic number, because the mean of its divisors is an integer number (1476219693360).
Almost surely, 210330116131111 is an apocalyptic number.
10330116131111 is a deficient number, since it is larger than the sum of its proper divisors (1479641415769).
10330116131111 is an equidigital number, since it uses as much as digits as its factorization.
10330116131111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 488817493.
The product of its (nonzero) digits is 162, while the sum is 23.
Adding to 10330116131111 its reverse (11113161103301), we get a palindrome (21443277234412).
The spelling of 10330116131111 in words is "ten trillion, three hundred thirty billion, one hundred sixteen million, one hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •