Base | Representation |
---|---|
bin | 100001110101101… |
… | …0000010100010101 |
3 | 2221010110221010212 |
4 | 1003223100110111 |
5 | 4311131200001 |
6 | 304355455205 |
7 | 40064563346 |
oct | 10353202425 |
9 | 2833427125 |
10 | 1135412501 |
11 | 532a02243 |
12 | 2782b7505 |
13 | 1512cc422 |
14 | aab1a0cd |
15 | 69a2d7bb |
hex | 43ad0515 |
1135412501 has 4 divisors (see below), whose sum is σ = 1144079904. Its totient is φ = 1126745100.
The previous prime is 1135412497. The next prime is 1135412521. The reversal of 1135412501 is 1052145311.
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 1135412501 - 22 = 1135412497 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 (1135412521) 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 3 ways as a sum of consecutive naturals, for example, 4333505 + ... + 4333766.
It is an arithmetic number, because the mean of its divisors is an integer number (286019976).
Almost surely, 21135412501 is an apocalyptic number.
It is an amenable number.
1135412501 is a deficient number, since it is larger than the sum of its proper divisors (8667403).
1135412501 is an equidigital number, since it uses as much as digits as its factorization.
1135412501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8667402.
The product of its (nonzero) digits is 600, while the sum is 23.
The square root of 1135412501 is about 33695.8825526206. The cubic root of 1135412501 is about 1043.2407848194.
Adding to 1135412501 its reverse (1052145311), we get a palindrome (2187557812).
The spelling of 1135412501 in words is "one billion, one hundred thirty-five million, four hundred twelve thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •