Base | Representation |
---|---|
bin | 10000001001110010111… |
… | …100110010101000001001 |
3 | 10221010011220110200200000 |
4 | 100021302330302220021 |
5 | 121141320201213001 |
6 | 2205535113233213 |
7 | 143124403115343 |
oct | 20116274625011 |
9 | 3833156420600 |
10 | 1110030101001 |
11 | 398841065368 |
12 | 15b16aa02809 |
13 | 808a1aa4693 |
14 | 3ba23624293 |
15 | 1dd1b307a86 |
hex | 10272f32a09 |
1110030101001 has 24 divisors (see below), whose sum is σ = 1664701662624. Its totient is φ = 739156428000.
The previous prime is 1110030100961. The next prime is 1110030101039. The reversal of 1110030101001 is 1001010300111.
It is not a de Polignac number, because 1110030101001 - 26 = 1110030100937 is a prime.
It is a super-2 number, since 2×11100301010012 (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 not an unprimeable number, because it can be changed into a prime (1110030101041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2456875 + ... + 2873376.
It is an arithmetic number, because the mean of its divisors is an integer number (69362569276).
Almost surely, 21110030101001 is an apocalyptic number.
It is an amenable number.
1110030101001 is a deficient number, since it is larger than the sum of its proper divisors (554671561623).
1110030101001 is an frugal number, since it uses more digits than its factorization.
1110030101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5331123 (or 5331111 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 9.
Adding to 1110030101001 its reverse (1001010300111), we get a palindrome (2111040401112).
The spelling of 1110030101001 in words is "one trillion, one hundred ten billion, thirty million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •