Base | Representation |
---|---|
bin | 10111011011011101101101… |
… | …110100111101111011010111 |
3 | 111111211202110020022101120011 |
4 | 113123131231310331323113 |
5 | 102001221320132000043 |
6 | 1003053005413421051 |
7 | 30463365543020164 |
oct | 2733355564757327 |
9 | 444752406271504 |
10 | 103042403000023 |
11 | 2a918046202423 |
12 | b68238433a787 |
13 | 4565b1a8246b6 |
14 | 1b633c94b706b |
15 | bda58196559d |
hex | 5db76dd3ded7 |
103042403000023 has 16 divisors (see below), whose sum is σ = 103711735733760. Its totient is φ = 102375121212000.
The previous prime is 103042402999997. The next prime is 103042403000041. The reversal of 103042403000023 is 320000304240301.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 103042403000023 - 213 = 103042402991831 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103042402999958 and 103042403000003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103042403600023) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 290450598 + ... + 290805148.
It is an arithmetic number, because the mean of its divisors is an integer number (6481983483360).
Almost surely, 2103042403000023 is an apocalyptic number.
103042403000023 is a deficient number, since it is larger than the sum of its proper divisors (669332733737).
103042403000023 is a wasteful number, since it uses less digits than its factorization.
103042403000023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 357438.
The product of its (nonzero) digits is 1728, while the sum is 22.
Adding to 103042403000023 its reverse (320000304240301), we get a palindrome (423042707240324).
The spelling of 103042403000023 in words is "one hundred three trillion, forty-two billion, four hundred three million, twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •