Base | Representation |
---|---|
bin | 1110001001001101111001… |
… | …01001001110010001101011 |
3 | 11002010102100011021121001222 |
4 | 13010212330221032101223 |
5 | 13034042442404111243 |
6 | 150052310452332255 |
7 | 6360055623223220 |
oct | 704467451162153 |
9 | 132112304247058 |
10 | 31103023113323 |
11 | 9a01799769907 |
12 | 35a3b8361408b |
13 | 1448005632275 |
14 | 797574155947 |
15 | 38e0dad87168 |
hex | 1c49bca4e46b |
31103023113323 has 16 divisors (see below), whose sum is σ = 35658057892800. Its totient is φ = 26576036015616.
The previous prime is 31103023113313. The next prime is 31103023113413. The reversal of 31103023113323 is 32331132030113.
It is a cyclic number.
It is not a de Polignac number, because 31103023113323 - 222 = 31103018919019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31103023113292 and 31103023113301.
It is not an unprimeable number, because it can be changed into a prime (31103023113313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1278536 + ... + 7990037.
It is an arithmetic number, because the mean of its divisors is an integer number (2228628618300).
Almost surely, 231103023113323 is an apocalyptic number.
31103023113323 is a deficient number, since it is larger than the sum of its proper divisors (4555034779477).
31103023113323 is a wasteful number, since it uses less digits than its factorization.
31103023113323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9270086.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 31103023113323 its reverse (32331132030113), we get a palindrome (63434155143436).
The spelling of 31103023113323 in words is "thirty-one trillion, one hundred three billion, twenty-three million, one hundred thirteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •