Base | Representation |
---|---|
bin | 10101000011001101… |
… | …00001000110001101 |
3 | 1002011121010120202121 |
4 | 22201212201012031 |
5 | 141121044212110 |
6 | 5105223052541 |
7 | 550024206160 |
oct | 124146410615 |
9 | 32147116677 |
10 | 11301163405 |
11 | 487a237374 |
12 | 22348a1151 |
13 | 10b1441b4c |
14 | 792ca7ad7 |
15 | 46222ccda |
hex | 2a19a118d |
11301163405 has 8 divisors (see below), whose sum is σ = 15498738432. Its totient is φ = 7749369168.
The previous prime is 11301163403. The next prime is 11301163409. The reversal of 11301163405 is 50436110311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11301163405 - 21 = 11301163403 is a prime.
It is a super-2 number, since 2×113011634052 (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 11301163405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11301163403) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 161445157 + ... + 161445226.
It is an arithmetic number, because the mean of its divisors is an integer number (1937342304).
Almost surely, 211301163405 is an apocalyptic number.
It is an amenable number.
11301163405 is a deficient number, since it is larger than the sum of its proper divisors (4197575027).
11301163405 is an equidigital number, since it uses as much as digits as its factorization.
11301163405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 322890395.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 11301163405 its reverse (50436110311), we get a palindrome (61737273716).
The spelling of 11301163405 in words is "eleven billion, three hundred one million, one hundred sixty-three thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •