Base | Representation |
---|---|
bin | 1010100100011111010111… |
… | …1101110101001010001001 |
3 | 1112011001110002011020022102 |
4 | 2221013311331311022021 |
5 | 3010403340332141441 |
6 | 40415025032203145 |
7 | 2306443214626505 |
oct | 251076575651211 |
9 | 45131402136272 |
10 | 11622013162121 |
11 | 3780960498a7a |
12 | 13785108394b5 |
13 | 663c4986147b |
14 | 2c2719225305 |
15 | 1524adda569b |
hex | a91f5f75289 |
11622013162121 has 4 divisors (see below), whose sum is σ = 11996916812544. Its totient is φ = 11247109511700.
The previous prime is 11622013162103. The next prime is 11622013162129. The reversal of 11622013162121 is 12126131022611.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11622013162121 - 222 = 11622008967817 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11622013162129) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 187451825165 + ... + 187451825226.
It is an arithmetic number, because the mean of its divisors is an integer number (2999229203136).
Almost surely, 211622013162121 is an apocalyptic number.
It is an amenable number.
11622013162121 is a deficient number, since it is larger than the sum of its proper divisors (374903650423).
11622013162121 is an equidigital number, since it uses as much as digits as its factorization.
11622013162121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 374903650422.
The product of its (nonzero) digits is 1728, while the sum is 29.
Adding to 11622013162121 its reverse (12126131022611), we get a palindrome (23748144184732).
The spelling of 11622013162121 in words is "eleven trillion, six hundred twenty-two billion, thirteen million, one hundred sixty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.266 sec. • engine limits •