Base | Representation |
---|---|
bin | 11110100110110111001… |
… | …010100111101001101011 |
3 | 21110002000102122100102211 |
4 | 132212313022213221223 |
5 | 233430040334201443 |
6 | 4250125340105551 |
7 | 304650014126524 |
oct | 36466712475153 |
9 | 7402012570384 |
10 | 2103312022123 |
11 | 741011892154 |
12 | 29b776b352b7 |
13 | 1234592a5200 |
14 | 73b2d73984b |
15 | 39aa2d9219d |
hex | 1e9b72a7a6b |
2103312022123 has 12 divisors (see below), whose sum is σ = 2277593836680. Its totient is φ = 1941482177856.
The previous prime is 2103312022109. The next prime is 2103312022171. The reversal of 2103312022123 is 3212202133012.
It is not a de Polignac number, because 2103312022123 - 213 = 2103312013931 is a prime.
It is a super-3 number, since 3×21033120221233 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2103312022094 and 2103312022103.
It is not an unprimeable number, because it can be changed into a prime (2103312022103) 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, 13604188 + ... + 13757926.
It is an arithmetic number, because the mean of its divisors is an integer number (189799486390).
Almost surely, 22103312022123 is an apocalyptic number.
2103312022123 is a deficient number, since it is larger than the sum of its proper divisors (174281814557).
2103312022123 is a wasteful number, since it uses less digits than its factorization.
2103312022123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234718 (or 234705 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 2103312022123 its reverse (3212202133012), we get a palindrome (5315514155135).
The spelling of 2103312022123 in words is "two trillion, one hundred three billion, three hundred twelve million, twenty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •