Base | Representation |
---|---|
bin | 110000100101000101… |
… | …0010100011000010001 |
3 | 100222021110221112201221 |
4 | 1201022022110120101 |
5 | 3202123244342001 |
6 | 115531525125041 |
7 | 10352142362233 |
oct | 1411212243021 |
9 | 328243845657 |
10 | 104323434001 |
11 | 4027494a056 |
12 | 18275859781 |
13 | 9ab7445407 |
14 | 5099328253 |
15 | 2aa8a9c1a1 |
hex | 184a294611 |
104323434001 has 8 divisors (see below), whose sum is σ = 105758574080. Its totient is φ = 102888457632.
The previous prime is 104323433999. The next prime is 104323434029. The reversal of 104323434001 is 100434323401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 104323434001 - 21 = 104323433999 is a prime.
It is a super-2 number, since 2×1043234340012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104323434071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1818880 + ... + 1875358.
It is an arithmetic number, because the mean of its divisors is an integer number (13219821760).
Almost surely, 2104323434001 is an apocalyptic number.
It is an amenable number.
104323434001 is a deficient number, since it is larger than the sum of its proper divisors (1435140079).
104323434001 is an equidigital number, since it uses as much as digits as its factorization.
104323434001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81855.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 104323434001 its reverse (100434323401), we get a palindrome (204757757402).
The spelling of 104323434001 in words is "one hundred four billion, three hundred twenty-three million, four hundred thirty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •