Base | Representation |
---|---|
bin | 10111001111011111110100… |
… | …001010010110010110100011 |
3 | 111101221010202011022102212110 |
4 | 113033133310022112112203 |
5 | 101344233101343444303 |
6 | 1001223121424530403 |
7 | 30350103314433510 |
oct | 2717376412262643 |
9 | 441833664272773 |
10 | 102220023031203 |
11 | 2a6302a5148930 |
12 | b56ab12a80a03 |
13 | 45063cb0a912c |
14 | 1b35692b42307 |
15 | bc3e9d9db703 |
hex | 5cf7f42965a3 |
102220023031203 has 16 divisors (see below), whose sum is σ = 169924194130176. Its totient is φ = 53101310665440.
The previous prime is 102220023031187. The next prime is 102220023031207. The reversal of 102220023031203 is 302130320022201.
It is a happy number.
It is not a de Polignac number, because 102220023031203 - 24 = 102220023031187 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 102220023031203.
It is not an unprimeable number, because it can be changed into a prime (102220023031207) 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, 221255460876 + ... + 221255461337.
It is an arithmetic number, because the mean of its divisors is an integer number (10620262133136).
Almost surely, 2102220023031203 is an apocalyptic number.
102220023031203 is a deficient number, since it is larger than the sum of its proper divisors (67704171098973).
102220023031203 is a wasteful number, since it uses less digits than its factorization.
102220023031203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 442510922234.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 102220023031203 its reverse (302130320022201), we get a palindrome (404350343053404).
The spelling of 102220023031203 in words is "one hundred two trillion, two hundred twenty billion, twenty-three million, thirty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •