Base | Representation |
---|---|
bin | 11101111110101110110… |
… | …10000000010001000111 |
3 | 10122110220012202220011220 |
4 | 32333113122000101013 |
5 | 113334131420231043 |
6 | 2105120531531423 |
7 | 134265053616333 |
oct | 16772732002107 |
9 | 3573805686156 |
10 | 1030111102023 |
11 | 36795a953583 |
12 | 147786159b73 |
13 | 761a6690783 |
14 | 37c015327c3 |
15 | 1bbdeed9483 |
hex | efd7680447 |
1030111102023 has 8 divisors (see below), whose sum is σ = 1377630961536. Its totient is φ = 684665988600.
The previous prime is 1030111102001. The next prime is 1030111102049. The reversal of 1030111102023 is 3202011110301.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1030111102023 - 212 = 1030111097927 is a prime.
It is a super-2 number, since 2×10301111020232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1030111101993 and 1030111102011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030111102073) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 518685363 + ... + 518687348.
It is an arithmetic number, because the mean of its divisors is an integer number (172203870192).
Almost surely, 21030111102023 is an apocalyptic number.
1030111102023 is a deficient number, since it is larger than the sum of its proper divisors (347519859513).
1030111102023 is a wasteful number, since it uses less digits than its factorization.
1030111102023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1037373045.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1030111102023 its reverse (3202011110301), we get a palindrome (4232122212324).
The spelling of 1030111102023 in words is "one trillion, thirty billion, one hundred eleven million, one hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •