Base | Representation |
---|---|
bin | 1000110010111011111… |
… | …1011000110111010101 |
3 | 112110001021022100122221 |
4 | 2030232333120313111 |
5 | 4433434212133323 |
6 | 153230415222341 |
7 | 13626462466306 |
oct | 2145677306725 |
9 | 473037270587 |
10 | 151112224213 |
11 | 590a4a02715 |
12 | 253532179b1 |
13 | 11332b201b2 |
14 | 74573927ad |
15 | 3de657c55d |
hex | 232efd8dd5 |
151112224213 has 2 divisors, whose sum is σ = 151112224214. Its totient is φ = 151112224212.
The previous prime is 151112224189. The next prime is 151112224223. The reversal of 151112224213 is 312422211151.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103132826449 + 47979397764 = 321143^2 + 219042^2 .
It is a cyclic number.
It is not a de Polignac number, because 151112224213 - 221 = 151110127061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (151112224223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75556112106 + 75556112107.
It is an arithmetic number, because the mean of its divisors is an integer number (75556112107).
Almost surely, 2151112224213 is an apocalyptic number.
It is an amenable number.
151112224213 is a deficient number, since it is larger than the sum of its proper divisors (1).
151112224213 is an equidigital number, since it uses as much as digits as its factorization.
151112224213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 960, while the sum is 25.
Adding to 151112224213 its reverse (312422211151), we get a palindrome (463534435364).
The spelling of 151112224213 in words is "one hundred fifty-one billion, one hundred twelve million, two hundred twenty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •