Base | Representation |
---|---|
bin | 101101010011011111010… |
… | …001001010100010101111 |
3 | 102000121222101020101211112 |
4 | 231103133101022202233 |
5 | 402002020322003403 |
6 | 10342121541342235 |
7 | 440633346365060 |
oct | 55233721124257 |
9 | 12017871211745 |
10 | 3113302141103 |
11 | aa0386993320 |
12 | 42346670797b |
13 | 1977771ab84b |
14 | aa982892567 |
15 | 55eb66b39d8 |
hex | 2d4df44a8af |
3113302141103 has 8 divisors (see below), whose sum is σ = 3881519552640. Its totient is φ = 2425949720280.
The previous prime is 3113302141099. The next prime is 3113302141109. The reversal of 3113302141103 is 3011412033113.
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 3113302141103 - 22 = 3113302141099 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3113302141109) 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 7 ways as a sum of consecutive naturals, for example, 20216247593 + ... + 20216247746.
It is an arithmetic number, because the mean of its divisors is an integer number (485189944080).
Almost surely, 23113302141103 is an apocalyptic number.
3113302141103 is a deficient number, since it is larger than the sum of its proper divisors (768217411537).
3113302141103 is a wasteful number, since it uses less digits than its factorization.
3113302141103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40432495357.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 3113302141103 its reverse (3011412033113), we get a palindrome (6124714174216).
The spelling of 3113302141103 in words is "three trillion, one hundred thirteen billion, three hundred two million, one hundred forty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •