Base | Representation |
---|---|
bin | 10000011101010101100… |
… | …100011101100001101101 |
3 | 11000010100011122122000102 |
4 | 100131111210131201231 |
5 | 122012303034122313 |
6 | 2223325120440445 |
7 | 144466350356666 |
oct | 20352544354155 |
9 | 4003304578012 |
10 | 1131012020333 |
11 | 3a6728888968 |
12 | 163245779125 |
13 | 82866a28870 |
14 | 3ca540ac36d |
15 | 1e648382a58 |
hex | 1075591d86d |
1131012020333 has 8 divisors (see below), whose sum is σ = 1243928114688. Its totient is φ = 1021798093104.
The previous prime is 1131012020233. The next prime is 1131012020339. The reversal of 1131012020333 is 3330202101311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1131012020333 - 216 = 1131011954797 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1131012020339) 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, 925541141 + ... + 925542362.
It is an arithmetic number, because the mean of its divisors is an integer number (155491014336).
Almost surely, 21131012020333 is an apocalyptic number.
1131012020333 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1131012020333 is a deficient number, since it is larger than the sum of its proper divisors (112916094355).
1131012020333 is a wasteful number, since it uses less digits than its factorization.
1131012020333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1851083563.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 1131012020333 its reverse (3330202101311), we get a palindrome (4461214121644).
The spelling of 1131012020333 in words is "one trillion, one hundred thirty-one billion, twelve million, twenty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •