Base | Representation |
---|---|
bin | 1010001101101011110010… |
… | …1100100110011010000001 |
3 | 1110202121010122222121222121 |
4 | 2203122330230212122001 |
5 | 2432443432320220001 |
6 | 35515030513404241 |
7 | 2236233036465121 |
oct | 243327454463201 |
9 | 43677118877877 |
10 | 11230210320001 |
11 | 363a783a55722 |
12 | 13145a6869681 |
13 | 636009566a0a |
14 | 2ab78b9acc81 |
15 | 1471cbe4e6a1 |
hex | a36bcb26681 |
11230210320001 has 8 divisors (see below), whose sum is σ = 11399120176320. Its totient is φ = 11061338545488.
The previous prime is 11230210319947. The next prime is 11230210320011. The reversal of 11230210320001 is 10002301203211.
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 11230210320001 - 27 = 11230210319873 is a prime.
It is a super-2 number, since 2×112302103200012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11230210320011) 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, 8925946 + ... + 10106083.
It is an arithmetic number, because the mean of its divisors is an integer number (1424890022040).
Almost surely, 211230210320001 is an apocalyptic number.
It is an amenable number.
11230210320001 is a deficient number, since it is larger than the sum of its proper divisors (168909856319).
11230210320001 is an equidigital number, since it uses as much as digits as its factorization.
11230210320001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19040903.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 11230210320001 its reverse (10002301203211), we get a palindrome (21232511523212).
The spelling of 11230210320001 in words is "eleven trillion, two hundred thirty billion, two hundred ten million, three hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •