Base | Representation |
---|---|
bin | 100001000101010… |
… | …0000100010111001 |
3 | 2212100202102201001 |
4 | 1002022200202321 |
5 | 4233133113001 |
6 | 302052125001 |
7 | 36336164203 |
oct | 10212404271 |
9 | 2770672631 |
10 | 1110051001 |
11 | 51a65a824 |
12 | 26b906761 |
13 | 148c8c817 |
14 | a75d7773 |
15 | 676be001 |
hex | 422a08b9 |
1110051001 has 8 divisors (see below), whose sum is σ = 1158955200. Its totient is φ = 1061200272.
The previous prime is 1110050999. The next prime is 1110051017. The reversal of 1110051001 is 1001500111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1110051001 - 21 = 1110050999 is a prime.
It is a super-2 number, since 2×11100510012 = 2464426449642204002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1110051031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 32446 + ... + 57208.
It is an arithmetic number, because the mean of its divisors is an integer number (144869400).
Almost surely, 21110051001 is an apocalyptic number.
It is an amenable number.
1110051001 is a deficient number, since it is larger than the sum of its proper divisors (48904199).
1110051001 is a wasteful number, since it uses less digits than its factorization.
1110051001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26735.
The product of its (nonzero) digits is 5, while the sum is 10.
The square root of 1110051001 is about 33317.4278869183. The cubic root of 1110051001 is about 1035.4146629757.
Adding to 1110051001 its reverse (1001500111), we get a palindrome (2111551112).
The spelling of 1110051001 in words is "one billion, one hundred ten million, fifty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •