Base | Representation |
---|---|
bin | 100001001011011… |
… | …1001110000100001 |
3 | 2212120212111111101 |
4 | 1002112321300201 |
5 | 4240001100001 |
6 | 302245514401 |
7 | 36405615412 |
oct | 10226716041 |
9 | 2776774441 |
10 | 1113300001 |
11 | 521479850 |
12 | 270a12a01 |
13 | 1498595c8 |
14 | a7c01809 |
15 | 67b11a01 |
hex | 425b9c21 |
1113300001 has 8 divisors (see below), whose sum is σ = 1219593600. Its totient is φ = 1007853840.
The previous prime is 1113299983. The next prime is 1113300007. The reversal of 1113300001 is 1000033111.
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 1113300001 - 211 = 1113297953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1113300007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 209106 + ... + 214363.
It is an arithmetic number, because the mean of its divisors is an integer number (152449200).
Almost surely, 21113300001 is an apocalyptic number.
1113300001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1113300001 is a deficient number, since it is larger than the sum of its proper divisors (106293599).
1113300001 is a wasteful number, since it uses less digits than its factorization.
1113300001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 423719.
The product of its (nonzero) digits is 9, while the sum is 10.
The square root of 1113300001 is about 33366.1505271435. The cubic root of 1113300001 is about 1036.4238614961.
Adding to 1113300001 its reverse (1000033111), we get a palindrome (2113333112).
The spelling of 1113300001 in words is "one billion, one hundred thirteen million, three hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •