Base | Representation |
---|---|
bin | 10000000001011000110… |
… | …001100111101010100011 |
3 | 10220020212122200101011022 |
4 | 100001120301213222203 |
5 | 121014322230432212 |
6 | 2201443133040055 |
7 | 142354555226153 |
oct | 20013061475243 |
9 | 3806778611138 |
10 | 1101001030307 |
11 | 394a28418972 |
12 | 15946b02602b |
13 | 7ca932b63b9 |
14 | 3b408402763 |
15 | 1d98d7d7772 |
hex | 10058c67aa3 |
1101001030307 has 4 divisors (see below), whose sum is σ = 1101993818640. Its totient is φ = 1100008241976.
The previous prime is 1101001030303. The next prime is 1101001030351. The reversal of 1101001030307 is 7030301001011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1101001030307 - 22 = 1101001030303 is a prime.
It is a super-3 number, since 3×11010010303073 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1101001030303) 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 3 ways as a sum of consecutive naturals, for example, 496392503 + ... + 496394720.
It is an arithmetic number, because the mean of its divisors is an integer number (275498454660).
Almost surely, 21101001030307 is an apocalyptic number.
1101001030307 is a deficient number, since it is larger than the sum of its proper divisors (992788333).
1101001030307 is an equidigital number, since it uses as much as digits as its factorization.
1101001030307 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 992788332.
The product of its (nonzero) digits is 63, while the sum is 17.
Adding to 1101001030307 its reverse (7030301001011), we get a palindrome (8131302031318).
The spelling of 1101001030307 in words is "one trillion, one hundred one billion, one million, thirty thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •