Base | Representation |
---|---|
bin | 10111001111100100110101… |
… | …111010110011101100100001 |
3 | 111101221122200100221212122121 |
4 | 113033210311322303230201 |
5 | 101344330130313030031 |
6 | 1001225413222504241 |
7 | 30350354143332235 |
oct | 2717446572635441 |
9 | 441848610855577 |
10 | 102225421220641 |
11 | 2a6326152a4514 |
12 | b56bb7a895081 |
13 | 4506a7b594174 |
14 | 1b35a45a565c5 |
15 | bc41b789a011 |
hex | 5cf935eb3b21 |
102225421220641 has 16 divisors (see below), whose sum is σ = 106050137356800. Its totient is φ = 98464245235200.
The previous prime is 102225421220591. The next prime is 102225421220647. The reversal of 102225421220641 is 146022124522201.
It is a cyclic number.
It is not a de Polignac number, because 102225421220641 - 211 = 102225421218593 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102225421220597 and 102225421220606.
It is not an unprimeable number, because it can be changed into a prime (102225421220647) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 58375236 + ... + 60100906.
It is an arithmetic number, because the mean of its divisors is an integer number (6628133584800).
Almost surely, 2102225421220641 is an apocalyptic number.
It is an amenable number.
102225421220641 is a deficient number, since it is larger than the sum of its proper divisors (3824716136159).
102225421220641 is a wasteful number, since it uses less digits than its factorization.
102225421220641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1744080.
The product of its (nonzero) digits is 30720, while the sum is 34.
Adding to 102225421220641 its reverse (146022124522201), we get a palindrome (248247545742842).
The spelling of 102225421220641 in words is "one hundred two trillion, two hundred twenty-five billion, four hundred twenty-one million, two hundred twenty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •