Base | Representation |
---|---|
bin | 111011100111001… |
… | …000110011010101 |
3 | 2120200220010102121 |
4 | 323213020303111 |
5 | 4022012143123 |
6 | 243123535541 |
7 | 33532561243 |
oct | 7347106325 |
9 | 2520803377 |
10 | 1000115413 |
11 | 4735a2570 |
12 | 23ab2a5b1 |
13 | 12c27a88b |
14 | 96b7b793 |
15 | 5cc0575d |
hex | 3b9c8cd5 |
1000115413 has 4 divisors (see below), whose sum is σ = 1091035008. Its totient is φ = 909195820.
The previous prime is 1000115401. The next prime is 1000115429. The reversal of 1000115413 is 3145110001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1000115413 - 25 = 1000115381 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000115713) 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, 45459781 + ... + 45459802.
It is an arithmetic number, because the mean of its divisors is an integer number (272758752).
Almost surely, 21000115413 is an apocalyptic number.
It is an amenable number.
1000115413 is a deficient number, since it is larger than the sum of its proper divisors (90919595).
1000115413 is an equidigital number, since it uses as much as digits as its factorization.
1000115413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90919594.
The product of its (nonzero) digits is 60, while the sum is 16.
The square root of 1000115413 is about 31624.6013887922. The cubic root of 1000115413 is about 1000.0384695201.
Adding to 1000115413 its reverse (3145110001), we get a palindrome (4145225414).
The spelling of 1000115413 in words is "one billion, one hundred fifteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •