Base | Representation |
---|---|
bin | 10011010111101011101… |
… | …111111011000111010011 |
3 | 11201020210122200101101101 |
4 | 103113223233323013103 |
5 | 133302043111244443 |
6 | 2455255434445231 |
7 | 165111621123100 |
oct | 23275357730723 |
9 | 4636718611341 |
10 | 1331100103123 |
11 | 473575340a5a |
12 | 195b86893817 |
13 | 986a337811b |
14 | 485d5b5baa7 |
15 | 2495940584d |
hex | 135ebbfb1d3 |
1331100103123 has 12 divisors (see below), whose sum is σ = 1574667022680. Its totient is φ = 1121604927072.
The previous prime is 1331100103117. The next prime is 1331100103141. The reversal of 1331100103123 is 3213010011331.
It is not a de Polignac number, because 1331100103123 - 217 = 1331099972051 is a prime.
It is a super-2 number, since 2×13311001031232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1331100103123.
It is not an unprimeable number, because it can be changed into a prime (1331100103183) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 230211586 + ... + 230217367.
It is an arithmetic number, because the mean of its divisors is an integer number (131222251890).
Almost surely, 21331100103123 is an apocalyptic number.
1331100103123 is a deficient number, since it is larger than the sum of its proper divisors (243566919557).
1331100103123 is an equidigital number, since it uses as much as digits as its factorization.
1331100103123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 460429026 (or 460429019 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1331100103123 its reverse (3213010011331), we get a palindrome (4544110114454).
The spelling of 1331100103123 in words is "one trillion, three hundred thirty-one billion, one hundred million, one hundred three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •