Base | Representation |
---|---|
bin | 10111001101110000111110… |
… | …100000001111100011011111 |
3 | 111101111202120000120000102121 |
4 | 113031300332200033203133 |
5 | 101340310332331401343 |
6 | 1001052320152203411 |
7 | 30335361144525400 |
oct | 2715607640174337 |
9 | 441452500500377 |
10 | 102101011200223 |
11 | 2a594883066822 |
12 | b54ba3a099567 |
13 | 44c8112848b79 |
14 | 1b2da02b479a7 |
15 | bc0d3567baed |
hex | 5cdc3e80f8df |
102101011200223 has 12 divisors (see below), whose sum is σ = 118805797277352. Its totient is φ = 87489191131440.
The previous prime is 102101011200173. The next prime is 102101011200233. The reversal of 102101011200223 is 322002110101201.
It is not a de Polignac number, because 102101011200223 - 217 = 102101011069151 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102101011200197 and 102101011200206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102101011200233) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 308896540 + ... + 309226897.
It is an arithmetic number, because the mean of its divisors is an integer number (9900483106446).
Almost surely, 2102101011200223 is an apocalyptic number.
102101011200223 is a deficient number, since it is larger than the sum of its proper divisors (16704786077129).
102101011200223 is an equidigital number, since it uses as much as digits as its factorization.
102101011200223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 618126822 (or 618126815 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 102101011200223 its reverse (322002110101201), we get a palindrome (424103121301424).
The spelling of 102101011200223 in words is "one hundred two trillion, one hundred one billion, eleven million, two hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •