Base | Representation |
---|---|
bin | 100111011011000101… |
… | …100010000001001111 |
3 | 11001021002001101201111 |
4 | 213123011202001033 |
5 | 1143143033203111 |
6 | 31240222352451 |
7 | 3025662113602 |
oct | 473305420117 |
9 | 131232041644 |
10 | 42330366031 |
11 | 16a5242a588 |
12 | 825442b727 |
13 | 3cb7aca185 |
14 | 2097ca2339 |
15 | 117b3a5a21 |
hex | 9db16204f |
42330366031 has 16 divisors (see below), whose sum is σ = 45215976960. Its totient is φ = 39532600800.
The previous prime is 42330365999. The next prime is 42330366037. The reversal of 42330366031 is 13066303324.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 42330366031 - 25 = 42330365999 is a prime.
It is a super-2 number, since 2×423303660312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 42330365984 and 42330366002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42330366037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3038181 + ... + 3052081.
It is an arithmetic number, because the mean of its divisors is an integer number (2825998560).
Almost surely, 242330366031 is an apocalyptic number.
42330366031 is a deficient number, since it is larger than the sum of its proper divisors (2885610929).
42330366031 is a wasteful number, since it uses less digits than its factorization.
42330366031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17046.
The product of its (nonzero) digits is 23328, while the sum is 31.
Adding to 42330366031 its reverse (13066303324), we get a palindrome (55396669355).
The spelling of 42330366031 in words is "forty-two billion, three hundred thirty million, three hundred sixty-six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •