Base | Representation |
---|---|
bin | 11101001100110011111… |
… | …11110001100100100011 |
3 | 10112220201110200021020222 |
4 | 32212121333301210203 |
5 | 112414240104342011 |
6 | 2044525324553255 |
7 | 132325660614431 |
oct | 16463177614443 |
9 | 3486643607228 |
10 | 1003311012131 |
11 | 357557a0135a |
12 | 1425469b282b |
13 | 737c523530c |
14 | 367bc08bd51 |
15 | 1b172291ddb |
hex | e999ff1923 |
1003311012131 has 4 divisors (see below), whose sum is σ = 1003323661152. Its totient is φ = 1003298363112.
The previous prime is 1003311012113. The next prime is 1003311012133. The reversal of 1003311012131 is 1312101133001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1003311012131 is a prime.
It is a super-2 number, since 2×10033110121312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1003311012133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6204776 + ... + 6364421.
It is an arithmetic number, because the mean of its divisors is an integer number (250830915288).
Almost surely, 21003311012131 is an apocalyptic number.
1003311012131 is a deficient number, since it is larger than the sum of its proper divisors (12649021).
1003311012131 is an equidigital number, since it uses as much as digits as its factorization.
1003311012131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12649020.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 1003311012131 its reverse (1312101133001), we get a palindrome (2315412145132).
The spelling of 1003311012131 in words is "one trillion, three billion, three hundred eleven million, twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •