Base | Representation |
---|---|
bin | 10111101110011001011001… |
… | …010101101000011101100001 |
3 | 111200110010122100021221021222 |
4 | 113232121121111220131201 |
5 | 102134030323142111001 |
6 | 1005530413442224425 |
7 | 30656364400616414 |
oct | 2756313125503541 |
9 | 450403570257258 |
10 | 104343434332001 |
11 | 302798904a8597 |
12 | b852559055115 |
13 | 462b70b4a9337 |
14 | 1baa36ba07b7b |
15 | c0e32b1aa61b |
hex | 5ee659568761 |
104343434332001 has 32 divisors (see below), whose sum is σ = 114082795008000. Its totient is φ = 95071050031104.
The previous prime is 104343434331989. The next prime is 104343434332013. The reversal of 104343434332001 is 100233434343401.
It is an interprime number because it is at equal distance from previous prime (104343434331989) and next prime (104343434332013).
It is not a de Polignac number, because 104343434332001 - 218 = 104343434069857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104343434332061) 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, 10832000 + ... + 18055998.
It is an arithmetic number, because the mean of its divisors is an integer number (3565087344000).
Almost surely, 2104343434332001 is an apocalyptic number.
It is an amenable number.
104343434332001 is a deficient number, since it is larger than the sum of its proper divisors (9739360675999).
104343434332001 is a wasteful number, since it uses less digits than its factorization.
104343434332001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7224305.
The product of its (nonzero) digits is 124416, while the sum is 35.
Adding to 104343434332001 its reverse (100233434343401), we get a palindrome (204576868675402).
The spelling of 104343434332001 in words is "one hundred four trillion, three hundred forty-three billion, four hundred thirty-four million, three hundred thirty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •