Base | Representation |
---|---|
bin | 100111011011001000… |
… | …100100111010001101 |
3 | 11001021010112221202001 |
4 | 213123020210322031 |
5 | 1143143234224201 |
6 | 31240251432301 |
7 | 3026001650116 |
oct | 473310447215 |
9 | 131233487661 |
10 | 42331164301 |
11 | 16a52925308 |
12 | 8254755691 |
13 | 3cb801961a |
14 | 209802d20d |
15 | 117b4b2301 |
hex | 9db224e8d |
42331164301 has 2 divisors, whose sum is σ = 42331164302. Its totient is φ = 42331164300.
The previous prime is 42331164259. The next prime is 42331164319. The reversal of 42331164301 is 10346113324.
42331164301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 40914771076 + 1416393225 = 202274^2 + 37635^2 .
It is a cyclic number.
It is not a de Polignac number, because 42331164301 - 27 = 42331164173 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 42331164301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42331164331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21165582150 + 21165582151.
It is an arithmetic number, because the mean of its divisors is an integer number (21165582151).
Almost surely, 242331164301 is an apocalyptic number.
It is an amenable number.
42331164301 is a deficient number, since it is larger than the sum of its proper divisors (1).
42331164301 is an equidigital number, since it uses as much as digits as its factorization.
42331164301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 42331164301 its reverse (10346113324), we get a palindrome (52677277625).
The spelling of 42331164301 in words is "forty-two billion, three hundred thirty-one million, one hundred sixty-four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •