Base | Representation |
---|---|
bin | 100111000111011010… |
… | …100011011000101011 |
3 | 11000102002000221121010 |
4 | 213013122203120223 |
5 | 1142004041113311 |
6 | 31143352515003 |
7 | 3014543635326 |
oct | 470732433053 |
9 | 130362027533 |
10 | 42000332331 |
11 | 168a3102361 |
12 | 81819aba63 |
13 | 3c64614c69 |
14 | 20661117bd |
15 | 115c412da6 |
hex | 9c76a362b |
42000332331 has 8 divisors (see below), whose sum is σ = 56002757184. Its totient is φ = 27999064520.
The previous prime is 42000332263. The next prime is 42000332357. The reversal of 42000332331 is 13323300024.
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 42000332331 - 217 = 42000201259 is a prime.
It is a super-2 number, since 2×420003323312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 42000332298 and 42000332307.
It is not an unprimeable number, because it can be changed into a prime (42000332531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 200685 + ... + 352526.
It is an arithmetic number, because the mean of its divisors is an integer number (7000344648).
Almost surely, 242000332331 is an apocalyptic number.
42000332331 is a deficient number, since it is larger than the sum of its proper divisors (14002424853).
42000332331 is a wasteful number, since it uses less digits than its factorization.
42000332331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 578521.
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 42000332331 its reverse (13323300024), we get a palindrome (55323632355).
The spelling of 42000332331 in words is "forty-two billion, three hundred thirty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •