Base | Representation |
---|---|
bin | 10011001100010011000111… |
… | …10100010100011101000111 |
3 | 12112102122221221121212202001 |
4 | 21212021203310110131013 |
5 | 21012432314431411101 |
6 | 225432132144530131 |
7 | 11614066020056023 |
oct | 1146114364243507 |
9 | 175378857555661 |
10 | 42204023310151 |
11 | 124a16979a156a |
12 | 489750a020947 |
13 | 1a71a8c8416a1 |
14 | a5c98550b383 |
15 | 4d2c5449a901 |
hex | 266263d14747 |
42204023310151 has 2 divisors, whose sum is σ = 42204023310152. Its totient is φ = 42204023310150.
The previous prime is 42204023309977. The next prime is 42204023310179. The reversal of 42204023310151 is 15101332040224.
It is an a-pointer prime, because the next prime (42204023310179) can be obtained adding 42204023310151 to its sum of digits (28).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 42204023310151 - 29 = 42204023309639 is a prime.
It is a super-2 number, since 2×422040233101512 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42204023310751) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21102011655075 + 21102011655076.
It is an arithmetic number, because the mean of its divisors is an integer number (21102011655076).
Almost surely, 242204023310151 is an apocalyptic number.
42204023310151 is a deficient number, since it is larger than the sum of its proper divisors (1).
42204023310151 is an equidigital number, since it uses as much as digits as its factorization.
42204023310151 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 42204023310151 its reverse (15101332040224), we get a palindrome (57305355350375).
The spelling of 42204023310151 in words is "forty-two trillion, two hundred four billion, twenty-three million, three hundred ten thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •