Base | Representation |
---|---|
bin | 11101111110101110111… |
… | …01011101111100011011 |
3 | 10122110220021111000201002 |
4 | 32333113131131330123 |
5 | 113334132133310021 |
6 | 2105121003215215 |
7 | 134265064420460 |
oct | 16772735357433 |
9 | 3573807430632 |
10 | 1030112010011 |
11 | 367960413787 |
12 | 14778651750b |
13 | 761a691ab46 |
14 | 37c016cb667 |
15 | 1bbe011850b |
hex | efd775df1b |
1030112010011 has 16 divisors (see below), whose sum is σ = 1206095213568. Its totient is φ = 861338836800.
The previous prime is 1030112009981. The next prime is 1030112010017. The reversal of 1030112010011 is 1100102110301.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1030112010011 - 214 = 1030111993627 is a prime.
It is a super-2 number, since 2×10301120100112 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1030112009974 and 1030112010001.
It is not an unprimeable number, because it can be changed into a prime (1030112010017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3087596 + ... + 3404918.
It is an arithmetic number, because the mean of its divisors is an integer number (75380950848).
Almost surely, 21030112010011 is an apocalyptic number.
1030112010011 is a deficient number, since it is larger than the sum of its proper divisors (175983203557).
1030112010011 is a wasteful number, since it uses less digits than its factorization.
1030112010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 328682.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 1030112010011 its reverse (1100102110301), we get a palindrome (2130214120312).
The spelling of 1030112010011 in words is "one trillion, thirty billion, one hundred twelve million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •