Base | Representation |
---|---|
bin | 11101111110101110101… |
… | …10001011101000101011 |
3 | 10122110220010212222200100 |
4 | 32333113112023220223 |
5 | 113334131141200021 |
6 | 2105120454240443 |
7 | 134265042244116 |
oct | 16772726135053 |
9 | 3573803788610 |
10 | 1030110100011 |
11 | 36795a329773 |
12 | 147785956123 |
13 | 761a63cc675 |
14 | 37c0135157d |
15 | 1bbded8c626 |
hex | efd758ba2b |
1030110100011 has 12 divisors (see below), whose sum is σ = 1490551821720. Its totient is φ = 685533138720.
The previous prime is 1030110100003. The next prime is 1030110100013. The reversal of 1030110100011 is 1100010110301.
It is not a de Polignac number, because 1030110100011 - 23 = 1030110100003 is a prime.
It is a super-2 number, since 2×10301101000112 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1030110099966 and 1030110100002.
It is not an unprimeable number, because it can be changed into a prime (1030110100013) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 100571925 + ... + 100582166.
It is an arithmetic number, because the mean of its divisors is an integer number (124212651810).
Almost surely, 21030110100011 is an apocalyptic number.
1030110100011 is a deficient number, since it is larger than the sum of its proper divisors (460441721709).
1030110100011 is a wasteful number, since it uses less digits than its factorization.
1030110100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201154666 (or 201154663 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 9.
Adding to 1030110100011 its reverse (1100010110301), we get a palindrome (2130120210312).
The spelling of 1030110100011 in words is "one trillion, thirty billion, one hundred ten million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •