Base | Representation |
---|---|
bin | 10111011100011111110001… |
… | …011010110110000010100101 |
3 | 111112002112112021101112210121 |
4 | 113130133301122312002211 |
5 | 102003402100014034341 |
6 | 1003145335430121541 |
7 | 30501456306321505 |
oct | 2734376132660245 |
9 | 445075467345717 |
10 | 103113330221221 |
11 | 2a945132829501 |
12 | b6940797b02b1 |
13 | 456c7120a6938 |
14 | 1b669d72d3a05 |
15 | bdc33367d4d1 |
hex | 5dc7f16b60a5 |
103113330221221 has 8 divisors (see below), whose sum is σ = 110716550097984. Its totient is φ = 95680969218240.
The previous prime is 103113330221179. The next prime is 103113330221299. The reversal of 103113330221221 is 122122033311301.
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 103113330221221 - 29 = 103113330220709 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 (103113330221021) 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, 42714717195 + ... + 42714719608.
It is an arithmetic number, because the mean of its divisors is an integer number (13839568762248).
Almost surely, 2103113330221221 is an apocalyptic number.
It is an amenable number.
103113330221221 is a deficient number, since it is larger than the sum of its proper divisors (7603219876763).
103113330221221 is an equidigital number, since it uses as much as digits as its factorization.
103113330221221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 85429436891.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 103113330221221 its reverse (122122033311301), we get a palindrome (225235363532522).
The spelling of 103113330221221 in words is "one hundred three trillion, one hundred thirteen billion, three hundred thirty million, two hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •