Base | Representation |
---|---|
bin | 10111001111100000110100… |
… | …011110011010000111000111 |
3 | 111101221020112100122022202010 |
4 | 113033200310132122013013 |
5 | 101344242304110000203 |
6 | 1001223420451345303 |
7 | 30350142125664423 |
oct | 2717406436320707 |
9 | 441836470568663 |
10 | 102221102031303 |
11 | 2a6307a921a652 |
12 | b56b1742b2233 |
13 | 45065407b6528 |
14 | 1b35756175b83 |
15 | bc40135c5303 |
hex | 5cf83479a1c7 |
102221102031303 has 8 divisors (see below), whose sum is σ = 136295972294400. Its totient is φ = 68146816561208.
The previous prime is 102221102031299. The next prime is 102221102031311. The reversal of 102221102031303 is 303130201122201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102221102031303 - 22 = 102221102031299 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102221102031303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102221102031383) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 145790223 + ... + 146489696.
It is an arithmetic number, because the mean of its divisors is an integer number (17036996536800).
Almost surely, 2102221102031303 is an apocalyptic number.
102221102031303 is a deficient number, since it is larger than the sum of its proper divisors (34074870263097).
102221102031303 is a wasteful number, since it uses less digits than its factorization.
102221102031303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292396501.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 102221102031303 its reverse (303130201122201), we get a palindrome (405351303153504).
The spelling of 102221102031303 in words is "one hundred two trillion, two hundred twenty-one billion, one hundred two million, thirty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.210 sec. • engine limits •