Base | Representation |
---|---|
bin | 10011100001000111001… |
… | …011111101011110110111 |
3 | 11202012221012210102121000 |
4 | 103201013023331132313 |
5 | 133433311333122403 |
6 | 2504052211254343 |
7 | 165620532603066 |
oct | 23410713753667 |
9 | 4665835712530 |
10 | 1341224114103 |
11 | 4778a0057285 |
12 | 197b312aa3b3 |
13 | 99627965073 |
14 | 48cb65621dd |
15 | 24d4d10c7a3 |
hex | 138472fd7b7 |
1341224114103 has 32 divisors (see below), whose sum is σ = 1995899443200. Its totient is φ = 890146279008.
The previous prime is 1341224114063. The next prime is 1341224114119. The reversal of 1341224114103 is 3014114221431.
It is a happy number.
1341224114103 is a `hidden beast` number, since 1 + 3 + 4 + 1 + 2 + 241 + 1 + 410 + 3 = 666.
It is not a de Polignac number, because 1341224114103 - 220 = 1341223065527 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1341224114303) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 23285926 + ... + 23343452.
It is an arithmetic number, because the mean of its divisors is an integer number (62371857600).
Almost surely, 21341224114103 is an apocalyptic number.
1341224114103 is a deficient number, since it is larger than the sum of its proper divisors (654675329097).
1341224114103 is a wasteful number, since it uses less digits than its factorization.
1341224114103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61388 (or 61382 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
Adding to 1341224114103 its reverse (3014114221431), we get a palindrome (4355338335534).
The spelling of 1341224114103 in words is "one trillion, three hundred forty-one billion, two hundred twenty-four million, one hundred fourteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •