Base | Representation |
---|---|
bin | 10111001100100110101010… |
… | …100101000000100100111111 |
3 | 111101020010121020100121000022 |
4 | 113030212222211000210333 |
5 | 101333003424310312203 |
6 | 1000551522414122355 |
7 | 30326534636563466 |
oct | 2714465245004477 |
9 | 441203536317008 |
10 | 102021220010303 |
11 | 2a563a5800a860 |
12 | b5384901b03bb |
13 | 44c0737a64419 |
14 | 1b29bd3a059dd |
15 | bbdc156a7a38 |
hex | 5cc9aa94093f |
102021220010303 has 8 divisors (see below), whose sum is σ = 111361383091200. Its totient is φ = 92691974715480.
The previous prime is 102021220010299. The next prime is 102021220010321. The reversal of 102021220010303 is 303010022120201.
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 102021220010303 - 22 = 102021220010299 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102029220010303) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2729426975 + ... + 2729464352.
It is an arithmetic number, because the mean of its divisors is an integer number (13920172886400).
Almost surely, 2102021220010303 is an apocalyptic number.
102021220010303 is a deficient number, since it is larger than the sum of its proper divisors (9340163080897).
102021220010303 is a wasteful number, since it uses less digits than its factorization.
102021220010303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5458893037.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 102021220010303 its reverse (303010022120201), we get a palindrome (405031242130504).
The spelling of 102021220010303 in words is "one hundred two trillion, twenty-one billion, two hundred twenty million, ten thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •