Base | Representation |
---|---|
bin | 1010010001111011101101… |
… | …0011000101111101100001 |
3 | 1111000120112112101121112002 |
4 | 2210132323103011331201 |
5 | 2440142424013102241 |
6 | 40012341411413345 |
7 | 2244425602543040 |
oct | 244367323057541 |
9 | 44016475347462 |
10 | 11303201300321 |
11 | 366872a507557 |
12 | 13267772b4255 |
13 | 63cb6c5582b8 |
14 | 2b1113920557 |
15 | 14904ee2189b |
hex | a47bb4c5f61 |
11303201300321 has 8 divisors (see below), whose sum is σ = 13094902485504. Its totient is φ = 9555739650720.
The previous prime is 11303201300309. The next prime is 11303201300323. The reversal of 11303201300321 is 12300310230311.
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 11303201300321 - 210 = 11303201299297 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11303201300293 and 11303201300302.
It is not an unprimeable number, because it can be changed into a prime (11303201300323) 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, 11059883345 + ... + 11059884366.
It is an arithmetic number, because the mean of its divisors is an integer number (1636862810688).
Almost surely, 211303201300321 is an apocalyptic number.
It is an amenable number.
11303201300321 is a deficient number, since it is larger than the sum of its proper divisors (1791701185183).
11303201300321 is an equidigital number, since it uses as much as digits as its factorization.
11303201300321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22119767791.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 11303201300321 its reverse (12300310230311), we get a palindrome (23603511530632).
The spelling of 11303201300321 in words is "eleven trillion, three hundred three billion, two hundred one million, three hundred thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •