Base | Representation |
---|---|
bin | 10111001101110000000010… |
… | …001111101010011111000010 |
3 | 111101111122221120012221211012 |
4 | 113031300002033222133002 |
5 | 101340301300024033442 |
6 | 1001052031555320522 |
7 | 30335324120406431 |
oct | 2715600217523702 |
9 | 441448846187735 |
10 | 102100000221122 |
11 | 2a594404424202 |
12 | b54b7b75b0142 |
13 | 44c7cb1266597 |
14 | 1b2d94877d118 |
15 | bc0cc6a2c582 |
hex | 5cdc023ea7c2 |
102100000221122 has 8 divisors (see below), whose sum is σ = 154125478041276. Its totient is φ = 50724840874032.
The previous prime is 102100000221119. The next prime is 102100000221143. The reversal of 102100000221122 is 221122000001201.
It can be written as a sum of positive squares in 2 ways, for example, as 101462891348641 + 637108872481 = 10072879^2 + 798191^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1021000002211222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102100000221097 and 102100000221106.
It is an unprimeable number.
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, 162579617873 + ... + 162579618500.
Almost surely, 2102100000221122 is an apocalyptic number.
102100000221122 is a deficient number, since it is larger than the sum of its proper divisors (52025477820154).
102100000221122 is a wasteful number, since it uses less digits than its factorization.
102100000221122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325159236532.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 102100000221122 its reverse (221122000001201), we get a palindrome (323222000222323).
The spelling of 102100000221122 in words is "one hundred two trillion, one hundred billion, two hundred twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •