Base | Representation |
---|---|
bin | 1010010011100000110001… |
… | …0111011111000101110111 |
3 | 1111010011120021002211021111 |
4 | 2210320030113133011313 |
5 | 2441114004242210403 |
6 | 40033025435455451 |
7 | 2246406112142653 |
oct | 244701427370567 |
9 | 44104507084244 |
10 | 11330331210103 |
11 | 36791916502a4 |
12 | 132ba88bb7587 |
13 | 6425a4122559 |
14 | 2b2568adba63 |
15 | 149adbab856d |
hex | a4e0c5df177 |
11330331210103 has 8 divisors (see below), whose sum is σ = 11414819363472. Its totient is φ = 11245868926656.
The previous prime is 11330331210091. The next prime is 11330331210137. The reversal of 11330331210103 is 30101213303311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11330331210103 is a prime.
It is a super-2 number, since 2×113303312101032 (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 (11330331210193) 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, 5587825 + ... + 7340602.
It is an arithmetic number, because the mean of its divisors is an integer number (1426852420434).
Almost surely, 211330331210103 is an apocalyptic number.
11330331210103 is a deficient number, since it is larger than the sum of its proper divisors (84488153369).
11330331210103 is a wasteful number, since it uses less digits than its factorization.
11330331210103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12934961.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 11330331210103 its reverse (30101213303311), we get a palindrome (41431544513414).
The spelling of 11330331210103 in words is "eleven trillion, three hundred thirty billion, three hundred thirty-one million, two hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •