Base | Representation |
---|---|
bin | 10111001111100001000111… |
… | …101111001111011111000011 |
3 | 111101221021100212202120101210 |
4 | 113033201013233033133003 |
5 | 101344243434323230311 |
6 | 1001223512514301203 |
7 | 30350153131656306 |
oct | 2717410757173703 |
9 | 441837325676353 |
10 | 102221425211331 |
11 | 2a630954696588 |
12 | b56b244587803 |
13 | 450659273c00a |
14 | 1b35787060b3d |
15 | bc4031b623a6 |
hex | 5cf847bcf7c3 |
102221425211331 has 24 divisors (see below), whose sum is σ = 142581934056016. Its totient is φ = 65137474480320.
The previous prime is 102221425211303. The next prime is 102221425211333. The reversal of 102221425211331 is 133112524122201.
It is not a de Polignac number, because 102221425211331 - 27 = 102221425211203 is a prime.
It is a super-2 number, since 2×1022214252113312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102221425211333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 21129040 + ... + 25512333.
Almost surely, 2102221425211331 is an apocalyptic number.
102221425211331 is a deficient number, since it is larger than the sum of its proper divisors (40360508844685).
102221425211331 is a wasteful number, since it uses less digits than its factorization.
102221425211331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46642803 (or 46642780 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 30.
Adding to 102221425211331 its reverse (133112524122201), we get a palindrome (235333949333532).
The spelling of 102221425211331 in words is "one hundred two trillion, two hundred twenty-one billion, four hundred twenty-five million, two hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.035 sec. • engine limits •