Base | Representation |
---|---|
bin | 1010000001011101111001… |
… | …0001101111010100011101 |
3 | 1110000112101001220012102102 |
4 | 2200113132101233110131 |
5 | 2421024103444301321 |
6 | 35234355410134445 |
7 | 2215122545013314 |
oct | 240273621572435 |
9 | 43015331805372 |
10 | 11020320306461 |
11 | 3569767571a14 |
12 | 129b98ab81425 |
13 | 61c29a28952b |
14 | 2a155a1d927b |
15 | 1419e55e5c0b |
hex | a05de46f51d |
11020320306461 has 8 divisors (see below), whose sum is σ = 11039998964544. Its totient is φ = 11000648655360.
The previous prime is 11020320306449. The next prime is 11020320306481. The reversal of 11020320306461 is 16460302302011.
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 11020320306461 - 234 = 11003140437277 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 (11020320306481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1401650 + ... + 4899516.
It is an arithmetic number, because the mean of its divisors is an integer number (1379999870568).
Almost surely, 211020320306461 is an apocalyptic number.
It is an amenable number.
11020320306461 is a deficient number, since it is larger than the sum of its proper divisors (19678658083).
11020320306461 is an equidigital number, since it uses as much as digits as its factorization.
11020320306461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3503491.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 11020320306461 its reverse (16460302302011), we get a palindrome (27480622608472).
The spelling of 11020320306461 in words is "eleven trillion, twenty billion, three hundred twenty million, three hundred six thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •