Base | Representation |
---|---|
bin | 10111001100010011000110… |
… | …111100111100011000001010 |
3 | 111101011010101210102000111021 |
4 | 113030103012330330120022 |
5 | 101332132423112210442 |
6 | 1000534131005023054 |
7 | 30325162365663634 |
oct | 2714230674743012 |
9 | 441133353360437 |
10 | 102000221210122 |
11 | 2a556061807444 |
12 | b5343ab854a8a |
13 | 44bb76c47c781 |
14 | 1b28ba0c05a54 |
15 | bbd3d6de5e67 |
hex | 5cc4c6f3c60a |
102000221210122 has 8 divisors (see below), whose sum is σ = 153000376848900. Its totient is φ = 51000095593824.
The previous prime is 102000221210113. The next prime is 102000221210123. The reversal of 102000221210122 is 221012122000201.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 94868164920841 + 7132056289281 = 9740029^2 + 2670591^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 102000221210096 and 102000221210105.
It is not an unprimeable number, because it can be changed into a prime (102000221210123) 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 3 ways as a sum of consecutive naturals, for example, 5484454 + ... + 15299662.
Almost surely, 2102000221210122 is an apocalyptic number.
102000221210122 is a deficient number, since it is larger than the sum of its proper divisors (51000155638778).
102000221210122 is an equidigital number, since it uses as much as digits as its factorization.
102000221210122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15011240.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 102000221210122 its reverse (221012122000201), we get a palindrome (323012343210323).
The spelling of 102000221210122 in words is "one hundred two trillion, two hundred twenty-one million, two hundred ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •