Base | Representation |
---|---|
bin | 110000011100101101… |
… | …0000101001001010001 |
3 | 100221112220001011102010 |
4 | 1200321122011021101 |
5 | 3201034320300413 |
6 | 115444004413133 |
7 | 10342160260620 |
oct | 1407132051121 |
9 | 327486034363 |
10 | 104042353233 |
11 | 401402179a5 |
12 | 181b76a71a9 |
13 | 9a7113cb30 |
14 | 506dc7b6b7 |
15 | 2a8e078dc3 |
hex | 1839685251 |
104042353233 has 32 divisors (see below), whose sum is σ = 176243802112. Its totient is φ = 53109172800.
The previous prime is 104042353229. The next prime is 104042353267. The reversal of 104042353233 is 332353240401.
It is not a de Polignac number, because 104042353233 - 22 = 104042353229 is a prime.
It is a super-2 number, since 2×1040423532332 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 104042353233.
It is not an unprimeable number, because it can be changed into a prime (104042353033) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6138433 + ... + 6155358.
It is an arithmetic number, because the mean of its divisors is an integer number (5507618816).
Almost surely, 2104042353233 is an apocalyptic number.
104042353233 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
104042353233 is a deficient number, since it is larger than the sum of its proper divisors (72201448879).
104042353233 is a wasteful number, since it uses less digits than its factorization.
104042353233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12293845.
The product of its (nonzero) digits is 25920, while the sum is 30.
Adding to 104042353233 its reverse (332353240401), we get a palindrome (436395593634).
The spelling of 104042353233 in words is "one hundred four billion, forty-two million, three hundred fifty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •