Base | Representation |
---|---|
bin | 11110000000100101000… |
… | …10101001000100000111 |
3 | 10122120110100121210222002 |
4 | 33000102202221010013 |
5 | 113343144411101043 |
6 | 2105403212255515 |
7 | 134331461530430 |
oct | 17002242510407 |
9 | 3576410553862 |
10 | 1031103222023 |
11 | 368319984a66 |
12 | 147a0247159b |
13 | 7630409c024 |
14 | 37c971cc487 |
15 | 1bc4c160bb8 |
hex | f0128a9107 |
1031103222023 has 16 divisors (see below), whose sum is σ = 1198426344960. Its totient is φ = 868787008416.
The previous prime is 1031103221999. The next prime is 1031103222047. The reversal of 1031103222023 is 3202223011301.
It is an interprime number because it is at equal distance from previous prime (1031103221999) and next prime (1031103222047).
It is a cyclic number.
It is not a de Polignac number, because 1031103222023 - 216 = 1031103156487 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1031103221986 and 1031103222004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1031103222323) 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, 15730265 + ... + 15795677.
It is an arithmetic number, because the mean of its divisors is an integer number (74901646560).
Almost surely, 21031103222023 is an apocalyptic number.
1031103222023 is a deficient number, since it is larger than the sum of its proper divisors (167323122937).
1031103222023 is an equidigital number, since it uses as much as digits as its factorization.
1031103222023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103646.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 1031103222023 its reverse (3202223011301), we get a palindrome (4233326233324).
The spelling of 1031103222023 in words is "one trillion, thirty-one billion, one hundred three million, two hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •