Base | Representation |
---|---|
bin | 1001001001010111100100… |
… | …10011001101110010000011 |
3 | 2122012210102122211120122002 |
4 | 10210223302103031302003 |
5 | 10114013113103101311 |
6 | 110435455334334215 |
7 | 4144060263132551 |
oct | 444536223156203 |
9 | 78183378746562 |
10 | 20113102003331 |
11 | 6454a11808167 |
12 | 230a0791ba36b |
13 | b2b87135a76c |
14 | 4d769d3dabd1 |
15 | 24d2c447093b |
hex | 124af24cdc83 |
20113102003331 has 8 divisors (see below), whose sum is σ = 21475668065280. Its totient is φ = 18791209555272.
The previous prime is 20113102003187. The next prime is 20113102003361. The reversal of 20113102003331 is 13330020131102.
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-20113102003331 is a prime.
It is a super-2 number, since 2×201131020033312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20113102003361) 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, 10168402451 + ... + 10168404428.
It is an arithmetic number, because the mean of its divisors is an integer number (2684458508160).
Almost surely, 220113102003331 is an apocalyptic number.
20113102003331 is a deficient number, since it is larger than the sum of its proper divisors (1362566061949).
20113102003331 is a wasteful number, since it uses less digits than its factorization.
20113102003331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20336806945.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 20113102003331 its reverse (13330020131102), we get a palindrome (33443122134433).
The spelling of 20113102003331 in words is "twenty trillion, one hundred thirteen billion, one hundred two million, three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •