Base | Representation |
---|---|
bin | 111011101100000… |
… | …011011011010011 |
3 | 2120210022121012022 |
4 | 323230003123103 |
5 | 4022324412430 |
6 | 243211322055 |
7 | 33546536345 |
oct | 7354033323 |
9 | 2523277168 |
10 | 1001404115 |
11 | 4742a2808 |
12 | 23b45032b |
13 | 12c60c31a |
14 | 96dd5295 |
15 | 5cdac4e5 |
hex | 3bb036d3 |
1001404115 has 4 divisors (see below), whose sum is σ = 1201684944. Its totient is φ = 801123288.
The previous prime is 1001404097. The next prime is 1001404123. The reversal of 1001404115 is 5114041001.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5114041001 = 47 ⋅108809383.
It is a cyclic number.
It is not a de Polignac number, because 1001404115 - 26 = 1001404051 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1001404093 and 1001404102.
It is an unprimeable number.
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, 100140407 + ... + 100140416.
It is an arithmetic number, because the mean of its divisors is an integer number (300421236).
Almost surely, 21001404115 is an apocalyptic number.
1001404115 is a deficient number, since it is larger than the sum of its proper divisors (200280829).
1001404115 is an equidigital number, since it uses as much as digits as its factorization.
1001404115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200280828.
The product of its (nonzero) digits is 80, while the sum is 17.
The square root of 1001404115 is about 31644.9698214424. The cubic root of 1001404115 is about 1000.4678194442.
Adding to 1001404115 its reverse (5114041001), we get a palindrome (6115445116).
The spelling of 1001404115 in words is "one billion, one million, four hundred four thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •