Base | Representation |
---|---|
bin | 110000100111011011… |
… | …1101101111111000111 |
3 | 100222110222121200101202 |
4 | 1201032313231333013 |
5 | 3202304011203411 |
6 | 115543430413115 |
7 | 10354122063611 |
oct | 1411667557707 |
9 | 328428550352 |
10 | 104402444231 |
11 | 40305504668 |
12 | 1829820119b |
13 | 9aca91a127 |
14 | 50a5a13db1 |
15 | 2ab09a783b |
hex | 184ededfc7 |
104402444231 has 4 divisors (see below), whose sum is σ = 105872901264. Its totient is φ = 102931987200.
The previous prime is 104402444221. The next prime is 104402444299. The reversal of 104402444231 is 132444204401.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104402444231 is a prime.
It is a super-2 number, since 2×1044024442312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104402444194 and 104402444203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104402444221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 735228410 + ... + 735228551.
It is an arithmetic number, because the mean of its divisors is an integer number (26468225316).
Almost surely, 2104402444231 is an apocalyptic number.
104402444231 is a deficient number, since it is larger than the sum of its proper divisors (1470457033).
104402444231 is an equidigital number, since it uses as much as digits as its factorization.
104402444231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1470457032.
The product of its (nonzero) digits is 12288, while the sum is 29.
Adding to 104402444231 its reverse (132444204401), we get a palindrome (236846648632).
The spelling of 104402444231 in words is "one hundred four billion, four hundred two million, four hundred forty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •