Base | Representation |
---|---|
bin | 1001100111100011000000… |
… | …11001010000011011010001 |
3 | 2202212220221101110112212112 |
4 | 10303301200121100123101 |
5 | 10233010233231332441 |
6 | 112552105325035105 |
7 | 4312016420306654 |
oct | 463614031203321 |
9 | 82786841415775 |
10 | 21150036199121 |
11 | 6814753066005 |
12 | 24570283b5a95 |
13 | ba559449450b |
14 | 53194ab9989b |
15 | 26a26347c4eb |
hex | 133c606506d1 |
21150036199121 has 2 divisors, whose sum is σ = 21150036199122. Its totient is φ = 21150036199120.
The previous prime is 21150036199111. The next prime is 21150036199139. The reversal of 21150036199121 is 12199163005112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20577836238400 + 572199960721 = 4536280^2 + 756439^2 .
It is a cyclic number.
It is not a de Polignac number, because 21150036199121 - 26 = 21150036199057 is a prime.
It is a super-2 number, since 2×211500361991212 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21150036199111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10575018099560 + 10575018099561.
It is an arithmetic number, because the mean of its divisors is an integer number (10575018099561).
Almost surely, 221150036199121 is an apocalyptic number.
It is an amenable number.
21150036199121 is a deficient number, since it is larger than the sum of its proper divisors (1).
21150036199121 is an equidigital number, since it uses as much as digits as its factorization.
21150036199121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 29160, while the sum is 41.
The spelling of 21150036199121 in words is "twenty-one trillion, one hundred fifty billion, thirty-six million, one hundred ninety-nine thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •