Base | Representation |
---|---|
bin | 10111001110000010101011… |
… | …101000101100100101100101 |
3 | 111101120120121220201210211220 |
4 | 113032002223220230211211 |
5 | 101341113301113031041 |
6 | 1001105142423450553 |
7 | 30336633225630462 |
oct | 2716025350544545 |
9 | 441516556653756 |
10 | 102120022002021 |
11 | 2a5a194917a571 |
12 | b5536648b6a59 |
13 | 44c9b522c910a |
14 | 1b308c78d4669 |
15 | bc159964bd66 |
hex | 5ce0aba2c965 |
102120022002021 has 8 divisors (see below), whose sum is σ = 136375813854144. Its totient is φ = 67972122408960.
The previous prime is 102120022002017. The next prime is 102120022002023. The reversal of 102120022002021 is 120200220021201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102120022002021 - 22 = 102120022002017 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102120022002023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26973062556 + ... + 26973066341.
It is an arithmetic number, because the mean of its divisors is an integer number (17046976731768).
Almost surely, 2102120022002021 is an apocalyptic number.
It is an amenable number.
102120022002021 is a deficient number, since it is larger than the sum of its proper divisors (34255791852123).
102120022002021 is an equidigital number, since it uses as much as digits as its factorization.
102120022002021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53946129531.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 102120022002021 its reverse (120200220021201), we get a palindrome (222320242023222).
The spelling of 102120022002021 in words is "one hundred two trillion, one hundred twenty billion, twenty-two million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •