Base | Representation |
---|---|
bin | 100000110010110… |
… | …1111110000111101 |
3 | 2211200121211020120 |
4 | 1001211233300331 |
5 | 4223201222023 |
6 | 301105405153 |
7 | 36161236056 |
oct | 10145576075 |
9 | 2750554216 |
10 | 1100414013 |
11 | 515178376 |
12 | 2686397b9 |
13 | 146c9726a |
14 | a620972d |
15 | 669188e3 |
hex | 4196fc3d |
1100414013 has 16 divisors (see below), whose sum is σ = 1545278400. Its totient is φ = 694621440.
The previous prime is 1100413997. The next prime is 1100414023. The reversal of 1100414013 is 3104140011.
It is not a de Polignac number, because 1100414013 - 24 = 1100413997 is a prime.
It is a super-2 number, since 2×11004140132 = 2421822000013528338, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1100413983 and 1100414001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100414023) 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 15 ways as a sum of consecutive naturals, for example, 132133 + ... + 140213.
It is an arithmetic number, because the mean of its divisors is an integer number (96579900).
Almost surely, 21100414013 is an apocalyptic number.
It is an amenable number.
1100414013 is a deficient number, since it is larger than the sum of its proper divisors (444864387).
1100414013 is a wasteful number, since it uses less digits than its factorization.
1100414013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10492.
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 1100414013 is about 33172.4887971946. The cubic root of 1100414013 is about 1032.4096075111.
Adding to 1100414013 its reverse (3104140011), we get a palindrome (4204554024).
The spelling of 1100414013 in words is "one billion, one hundred million, four hundred fourteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •