Base | Representation |
---|---|
bin | 11110100110110111001… |
… | …111100010010100110111 |
3 | 21110002000112001211111011 |
4 | 132212313033202110313 |
5 | 233430041201423111 |
6 | 4250125423453051 |
7 | 304650031105342 |
oct | 36466717422467 |
9 | 7402015054434 |
10 | 2103313311031 |
11 | 741012592569 |
12 | 29b777457187 |
13 | 123459636a8a |
14 | 73b2d993459 |
15 | 39aa3049021 |
hex | 1e9b73e2537 |
2103313311031 has 16 divisors (see below), whose sum is σ = 2117690591328. Its totient is φ = 2088995238400.
The previous prime is 2103313311017. The next prime is 2103313311083. The reversal of 2103313311031 is 1301133133012.
It is a cyclic number.
It is not a de Polignac number, because 2103313311031 - 217 = 2103313179959 is a prime.
It is a super-2 number, since 2×21033133110312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2103313310993 and 2103313311011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2103313311091) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 123476091 + ... + 123493123.
It is an arithmetic number, because the mean of its divisors is an integer number (132355661958).
Almost surely, 22103313311031 is an apocalyptic number.
2103313311031 is a deficient number, since it is larger than the sum of its proper divisors (14377280297).
2103313311031 is a wasteful number, since it uses less digits than its factorization.
2103313311031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18722.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 2103313311031 its reverse (1301133133012), we get a palindrome (3404446444043).
The spelling of 2103313311031 in words is "two trillion, one hundred three billion, three hundred thirteen million, three hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •