Base | Representation |
---|---|
bin | 1001001110111000010001… |
… | …1110001111110101100111 |
3 | 1022221110002200121112200001 |
4 | 2103232010132033311213 |
5 | 2312304204420222101 |
6 | 33331224422002131 |
7 | 2065254643241335 |
oct | 223560436176547 |
9 | 38843080545601 |
10 | 10151230242151 |
11 | 3264126914319 |
12 | 117b462576347 |
13 | 58834555a3cb |
14 | 271472042b55 |
15 | 1290cba33901 |
hex | 93b8478fd67 |
10151230242151 has 2 divisors, whose sum is σ = 10151230242152. Its totient is φ = 10151230242150.
The previous prime is 10151230242133. The next prime is 10151230242227. The reversal of 10151230242151 is 15124203215101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10151230242151 - 211 = 10151230240103 is a prime.
It is a super-2 number, since 2×101512302421512 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10151230242451) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5075615121075 + 5075615121076.
It is an arithmetic number, because the mean of its divisors is an integer number (5075615121076).
Almost surely, 210151230242151 is an apocalyptic number.
10151230242151 is a deficient number, since it is larger than the sum of its proper divisors (1).
10151230242151 is an equidigital number, since it uses as much as digits as its factorization.
10151230242151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2400, while the sum is 28.
Adding to 10151230242151 its reverse (15124203215101), we get a palindrome (25275433457252).
The spelling of 10151230242151 in words is "ten trillion, one hundred fifty-one billion, two hundred thirty million, two hundred forty-two thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •