Base | Representation |
---|---|
bin | 10111011101110100011100… |
… | …010000000010100000101111 |
3 | 111112102020012011001102200011 |
4 | 113131310130100002200233 |
5 | 102011344242214402343 |
6 | 1003255212541114051 |
7 | 30511155232245145 |
oct | 2735643420024057 |
9 | 445366164042604 |
10 | 103204243122223 |
11 | 2a97a745793631 |
12 | b6a9810258927 |
13 | 457817008b709 |
14 | 1b6b17d549595 |
15 | bde8a4c3429d |
hex | 5ddd1c40282f |
103204243122223 has 16 divisors (see below), whose sum is σ = 111837122876160. Its totient is φ = 94856873521536.
The previous prime is 103204243122187. The next prime is 103204243122251. The reversal of 103204243122223 is 322221342402301.
It is a cyclic number.
It is not a de Polignac number, because 103204243122223 - 225 = 103204209567791 is a prime.
It is a super-2 number, since 2×1032042431222232 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103204243122523) 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, 9166083 + ... + 17041876.
It is an arithmetic number, because the mean of its divisors is an integer number (6989820179760).
Almost surely, 2103204243122223 is an apocalyptic number.
103204243122223 is a deficient number, since it is larger than the sum of its proper divisors (8632879753937).
103204243122223 is a wasteful number, since it uses less digits than its factorization.
103204243122223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26213406.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 103204243122223 its reverse (322221342402301), we get a palindrome (425425585524524).
The spelling of 103204243122223 in words is "one hundred three trillion, two hundred four billion, two hundred forty-three million, one hundred twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •