Base | Representation |
---|---|
bin | 100111011010000100… |
… | …001010101111011100 |
3 | 11001012212210212022201 |
4 | 213122010022233130 |
5 | 1143124141400244 |
6 | 31234411221244 |
7 | 3025363350310 |
oct | 473204125734 |
9 | 131185725281 |
10 | 42313231324 |
11 | 16a43796a71 |
12 | 824a747824 |
13 | 3cb43aacb0 |
14 | 20958c1b40 |
15 | 1179b1dad4 |
hex | 9da10abdc |
42313231324 has 24 divisors (see below), whose sum is σ = 91136191328. Its totient is φ = 16739300160.
The previous prime is 42313231321. The next prime is 42313231327.
It is a happy number.
42313231324 is nontrivially palindromic in base 10.
42313231324 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (42313231321) and next prime (42313231327).
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 42313231292 and 42313231301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42313231321) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 58122207 + ... + 58122934.
Almost surely, 242313231324 is an apocalyptic number.
It is an amenable number.
42313231324 is an abundant number, since it is smaller than the sum of its proper divisors (48822960004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42313231324 is a wasteful number, since it uses less digits than its factorization.
42313231324 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116245165 (or 116245163 counting only the distinct ones).
The product of its digits is 10368, while the sum is 28.
The spelling of 42313231324 in words is "forty-two billion, three hundred thirteen million, two hundred thirty-one thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •