Base | Representation |
---|---|
bin | 10000000100010100000… |
… | …001000010101000100011 |
3 | 10220112222120202010011101 |
4 | 100010110001002220203 |
5 | 121042240424143243 |
6 | 2203122551455231 |
7 | 142525451436256 |
oct | 20042401025043 |
9 | 3815876663141 |
10 | 1104142412323 |
11 | 39629a674755 |
12 | 159ba7087517 |
13 | 80174070022 |
14 | 3b6256cd09d |
15 | 1dac44a754d |
hex | 10114042a23 |
1104142412323 has 32 divisors (see below), whose sum is σ = 1157076264960. Its totient is φ = 1052302567680.
The previous prime is 1104142412309. The next prime is 1104142412341. The reversal of 1104142412323 is 3232142414011.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1104142412323 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1104142412291 and 1104142412300.
It is not an unprimeable number, because it can be changed into a prime (1104142812323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1006510311 + ... + 1006511407.
It is an arithmetic number, because the mean of its divisors is an integer number (36158633280).
Almost surely, 21104142412323 is an apocalyptic number.
1104142412323 is a deficient number, since it is larger than the sum of its proper divisors (52933852637).
1104142412323 is a wasteful number, since it uses less digits than its factorization.
1104142412323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2427.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 1104142412323 its reverse (3232142414011), we get a palindrome (4336284826334).
The spelling of 1104142412323 in words is "one trillion, one hundred four billion, one hundred forty-two million, four hundred twelve thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •