Base | Representation |
---|---|
bin | 110000100001110000… |
… | …1101010110000000001 |
3 | 100221222201110220222222 |
4 | 1201003201222300001 |
5 | 3201411300130213 |
6 | 115512511140425 |
7 | 10346321233340 |
oct | 1410341526001 |
9 | 327881426888 |
10 | 104212114433 |
11 | 40218027009 |
12 | 18244514715 |
13 | 9a9a36a54b |
14 | 508862bb57 |
15 | 2a9de0d808 |
hex | 184386ac01 |
104212114433 has 8 divisors (see below), whose sum is σ = 119698051200. Its totient is φ = 88875800640.
The previous prime is 104212114417. The next prime is 104212114463. The reversal of 104212114433 is 334411212401.
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 104212114433 - 24 = 104212114417 is a prime.
It is a super-2 number, since 2×1042121144332 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (104212114463) 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, 37404248 + ... + 37407033.
It is an arithmetic number, because the mean of its divisors is an integer number (14962256400).
Almost surely, 2104212114433 is an apocalyptic number.
It is an amenable number.
104212114433 is a deficient number, since it is larger than the sum of its proper divisors (15485936767).
104212114433 is an equidigital number, since it uses as much as digits as its factorization.
104212114433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74811487.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 104212114433 its reverse (334411212401), we get a palindrome (438623326834).
The spelling of 104212114433 in words is "one hundred four billion, two hundred twelve million, one hundred fourteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •