Base | Representation |
---|---|
bin | 11101111110110001011… |
… | …01111011001000111001 |
3 | 10122110221202011120021000 |
4 | 32333120231323020321 |
5 | 113334203033213423 |
6 | 2105123035235213 |
7 | 134265441612534 |
oct | 16773055731071 |
9 | 3573852146230 |
10 | 1030133101113 |
11 | 367971309846 |
12 | 1477915a8b09 |
13 | 761ab0c3a9c |
14 | 37c0441ba1b |
15 | 1bbe1dd2843 |
hex | efd8b7b239 |
1030133101113 has 16 divisors (see below), whose sum is σ = 1528139157760. Its totient is φ = 685848180528.
The previous prime is 1030133101099. The next prime is 1030133101133. The reversal of 1030133101113 is 3111013310301.
1030133101113 is a `hidden beast` number, since 10 + 301 + 331 + 0 + 11 + 13 = 666.
It is not a de Polignac number, because 1030133101113 - 222 = 1030128906809 is a prime.
It is a super-2 number, since 2×10301331011132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1030133101133) 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, 25179745 + ... + 25220622.
It is an arithmetic number, because the mean of its divisors is an integer number (95508697360).
Almost surely, 21030133101113 is an apocalyptic number.
It is an amenable number.
1030133101113 is a deficient number, since it is larger than the sum of its proper divisors (498006056647).
1030133101113 is an equidigital number, since it uses as much as digits as its factorization.
1030133101113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50401133 (or 50401127 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 18.
Adding to 1030133101113 its reverse (3111013310301), we get a palindrome (4141146411414).
The spelling of 1030133101113 in words is "one trillion, thirty billion, one hundred thirty-three million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •