Base | Representation |
---|---|
bin | 11101111110101110110… |
… | …10011000011101001111 |
3 | 10122110220012221221002112 |
4 | 32333113122120131033 |
5 | 113334131431413403 |
6 | 2105120534014235 |
7 | 134265054511235 |
oct | 16772732303517 |
9 | 3573805857075 |
10 | 1030111201103 |
11 | 36795aa10a66 |
12 | 1477861a737b |
13 | 761a66c68ba |
14 | 37c0155a955 |
15 | 1bbe00089d8 |
hex | efd769874f |
1030111201103 has 16 divisors (see below), whose sum is σ = 1042279677216. Its totient is φ = 1017983030400.
The previous prime is 1030111201079. The next prime is 1030111201127. The reversal of 1030111201103 is 3011021110301.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1030111201079) and next prime (1030111201127).
It is a cyclic number.
It is not a de Polignac number, because 1030111201103 - 28 = 1030111200847 is a prime.
It is a super-2 number, since 2×10301112011032 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030111204103) 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, 205896200 + ... + 205901202.
It is an arithmetic number, because the mean of its divisors is an integer number (65142479826).
Almost surely, 21030111201103 is an apocalyptic number.
1030111201103 is a deficient number, since it is larger than the sum of its proper divisors (12168476113).
1030111201103 is a wasteful number, since it uses less digits than its factorization.
1030111201103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8554.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 1030111201103 its reverse (3011021110301), we get a palindrome (4041132311404).
The spelling of 1030111201103 in words is "one trillion, thirty billion, one hundred eleven million, two hundred one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •