Base | Representation |
---|---|
bin | 1010001101101011110101… |
… | …0001100100011000000011 |
3 | 1110202121011100012222112220 |
4 | 2203122331101210120003 |
5 | 2432443442310323021 |
6 | 35515031501222123 |
7 | 2236233215036601 |
oct | 243327521443003 |
9 | 43677140188486 |
10 | 11230220011011 |
11 | 363a789474721 |
12 | 13145a9b61943 |
13 | 63600b57aa41 |
14 | 2ab78cdb2871 |
15 | 1471ccc15cc6 |
hex | a36bd464603 |
11230220011011 has 8 divisors (see below), whose sum is σ = 15005967129600. Its totient is φ = 7470643116552.
The previous prime is 11230220010929. The next prime is 11230220011079. The reversal of 11230220011011 is 11011002203211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11230220011011 - 213 = 11230220002819 is a prime.
It is a super-2 number, since 2×112302200110112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11230220011111) 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, 4042554411 + ... + 4042557188.
It is an arithmetic number, because the mean of its divisors is an integer number (1875745891200).
Almost surely, 211230220011011 is an apocalyptic number.
11230220011011 is a deficient number, since it is larger than the sum of its proper divisors (3775747118589).
11230220011011 is an equidigital number, since it uses as much as digits as its factorization.
11230220011011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8085112065.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 11230220011011 its reverse (11011002203211), we get a palindrome (22241222214222).
It can be divided in two parts, 112302200 and 11011, that added together give a palindrome (112313211).
The spelling of 11230220011011 in words is "eleven trillion, two hundred thirty billion, two hundred twenty million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •