Base | Representation |
---|---|
bin | 110000100010000101… |
… | …1111101101101010101 |
3 | 100222000111100020110112 |
4 | 1201010023331231111 |
5 | 3201422114432013 |
6 | 115513544532405 |
7 | 10346514413111 |
oct | 1410413755525 |
9 | 328014306415 |
10 | 104223202133 |
11 | 4022330a3a6 |
12 | 18248181105 |
13 | 9a9c75020b |
14 | 5089cb6741 |
15 | 2a9ed9dba8 |
hex | 18442fdb55 |
104223202133 has 16 divisors (see below), whose sum is σ = 111387225600. Its totient is φ = 97290733056.
The previous prime is 104223202121. The next prime is 104223202141. The reversal of 104223202133 is 331202322401.
It is not a de Polignac number, because 104223202133 - 226 = 104156093269 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104223202099 and 104223202108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104223202103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 239141 + ... + 515397.
It is an arithmetic number, because the mean of its divisors is an integer number (6961701600).
Almost surely, 2104223202133 is an apocalyptic number.
It is an amenable number.
104223202133 is a deficient number, since it is larger than the sum of its proper divisors (7164023467).
104223202133 is a wasteful number, since it uses less digits than its factorization.
104223202133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276676.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 104223202133 its reverse (331202322401), we get a palindrome (435425524534).
The spelling of 104223202133 in words is "one hundred four billion, two hundred twenty-three million, two hundred two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •