Base | Representation |
---|---|
bin | 10111001100100110101010… |
… | …000011000100000000000011 |
3 | 111101020010120121121111001022 |
4 | 113030212222003010000003 |
5 | 101333003420021031202 |
6 | 1000551521455300055 |
7 | 30326534501131316 |
oct | 2714465203040003 |
9 | 441203517544038 |
10 | 102021211111427 |
11 | 2a563a52a91a13 |
12 | b53848921a62b |
13 | 44c0735c69b0a |
14 | 1b29bd276a97d |
15 | bbdc149eaea2 |
hex | 5cc9aa0c4003 |
102021211111427 has 2 divisors, whose sum is σ = 102021211111428. Its totient is φ = 102021211111426.
The previous prime is 102021211111213. The next prime is 102021211111451. The reversal of 102021211111427 is 724111112120201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102021211111427 - 224 = 102021194334211 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102021211111396 and 102021211111405.
It is not a weakly prime, because it can be changed into another prime (102021811111427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51010605555713 + 51010605555714.
It is an arithmetic number, because the mean of its divisors is an integer number (51010605555714).
Almost surely, 2102021211111427 is an apocalyptic number.
102021211111427 is a deficient number, since it is larger than the sum of its proper divisors (1).
102021211111427 is an equidigital number, since it uses as much as digits as its factorization.
102021211111427 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 448, while the sum is 26.
Adding to 102021211111427 its reverse (724111112120201), we get a palindrome (826132323231628).
The spelling of 102021211111427 in words is "one hundred two trillion, twenty-one billion, two hundred eleven million, one hundred eleven thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •