Base | Representation |
---|---|
bin | 110011010111001100… |
… | …1011111010110100001 |
3 | 101112201000002122011221 |
4 | 1212232121133112201 |
5 | 3301343311200001 |
6 | 122400545535041 |
7 | 10653224244400 |
oct | 1465631372641 |
9 | 345630078157 |
10 | 110300100001 |
11 | 42861592743 |
12 | 19463344481 |
13 | a52a731380 |
14 | 54a4dc1637 |
15 | 2d086261a1 |
hex | 19ae65f5a1 |
110300100001 has 24 divisors (see below), whose sum is σ = 139602742440. Its totient is φ = 86370665472.
The previous prime is 110300099957. The next prime is 110300100019. The reversal of 110300100001 is 100001003011.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 1228432401 + 109071667600 = 35049^2 + 330260^2 .
It is not a de Polignac number, because 110300100001 - 211 = 110300097953 is a prime.
It is a super-2 number, since 2×1103001000012 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is not an unprimeable number, because it can be changed into a prime (110300100061) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 830766 + ... + 954343.
It is an arithmetic number, because the mean of its divisors is an integer number (5816780935).
Almost surely, 2110300100001 is an apocalyptic number.
It is an amenable number.
110300100001 is a deficient number, since it is larger than the sum of its proper divisors (29302642439).
110300100001 is a wasteful number, since it uses less digits than its factorization.
110300100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1785233 (or 1785226 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 7.
Adding to 110300100001 its reverse (100001003011), we get a palindrome (210301103012).
The spelling of 110300100001 in words is "one hundred ten billion, three hundred million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •