Base | Representation |
---|---|
bin | 10101011011100111… |
… | …11100011110100001 |
3 | 1002200212120212111011 |
4 | 22231303330132201 |
5 | 142031014310032 |
6 | 5141421420521 |
7 | 555062320465 |
oct | 125563743641 |
9 | 32625525434 |
10 | 11506010017 |
11 | 497492a697 |
12 | 229140a741 |
13 | 1114a05168 |
14 | 7b218c4a5 |
15 | 4751e3247 |
hex | 2adcfc7a1 |
11506010017 has 4 divisors (see below), whose sum is σ = 11506622896. Its totient is φ = 11505397140.
The previous prime is 11506009993. The next prime is 11506010053. The reversal of 11506010017 is 71001060511.
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 11506010017 - 219 = 11505485729 is a prime.
It is a super-2 number, since 2×115060100172 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11506010017.
It is not an unprimeable number, because it can be changed into a prime (11506010077) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 277359 + ... + 316132.
It is an arithmetic number, because the mean of its divisors is an integer number (2876655724).
Almost surely, 211506010017 is an apocalyptic number.
It is an amenable number.
11506010017 is a deficient number, since it is larger than the sum of its proper divisors (612879).
11506010017 is an equidigital number, since it uses as much as digits as its factorization.
11506010017 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 612878.
The product of its (nonzero) digits is 210, while the sum is 22.
Adding to 11506010017 its reverse (71001060511), we get a palindrome (82507070528).
The spelling of 11506010017 in words is "eleven billion, five hundred six million, ten thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •