Base | Representation |
---|---|
bin | 10111001111100010101101… |
… | …010111010101101011110110 |
3 | 111101221102202201001001101020 |
4 | 113033202231113111223312 |
5 | 101344310432314040202 |
6 | 1001224354022442010 |
7 | 30350243314215666 |
oct | 2717425527255366 |
9 | 441842681031336 |
10 | 102223130221302 |
11 | 2a63164a070832 |
12 | b56b63b593306 |
13 | 45067a4a50a5c |
14 | 1b358a968c1a6 |
15 | bc40d16a55bc |
hex | 5cf8ad5d5af6 |
102223130221302 has 8 divisors (see below), whose sum is σ = 204446260442616. Its totient is φ = 34074376740432.
The previous prime is 102223130221217. The next prime is 102223130221349. The reversal of 102223130221302 is 203122031322201.
It is a sphenic number, since it is the product of 3 distinct primes.
102223130221302 is an admirable number.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 8518594185103 + ... + 8518594185114.
It is an arithmetic number, because the mean of its divisors is an integer number (25555782555327).
Almost surely, 2102223130221302 is an apocalyptic number.
102223130221302 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102223130221302 is a wasteful number, since it uses less digits than its factorization.
102223130221302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17037188370222.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 102223130221302 its reverse (203122031322201), we get a palindrome (305345161543503).
The spelling of 102223130221302 in words is "one hundred two trillion, two hundred twenty-three billion, one hundred thirty million, two hundred twenty-one thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •