Base | Representation |
---|---|
bin | 1000110000100100010… |
… | …0011100011010010011 |
3 | 112101101221011121001001 |
4 | 2030021010130122103 |
5 | 4431133324442001 |
6 | 153043331122431 |
7 | 13604636011552 |
oct | 2141104343223 |
9 | 471357147031 |
10 | 150476015251 |
11 | 588a8873491 |
12 | 251b6143417 |
13 | 112610874a3 |
14 | 73d6aa1d99 |
15 | 3daa7ab001 |
hex | 230911c693 |
150476015251 has 2 divisors, whose sum is σ = 150476015252. Its totient is φ = 150476015250.
The previous prime is 150476015213. The next prime is 150476015257. The reversal of 150476015251 is 152510674051.
It is a strong prime.
It is an emirp because it is prime and its reverse (152510674051) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-150476015251 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 150476015251.
It is not a weakly prime, because it can be changed into another prime (150476015257) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75238007625 + 75238007626.
It is an arithmetic number, because the mean of its divisors is an integer number (75238007626).
Almost surely, 2150476015251 is an apocalyptic number.
150476015251 is a deficient number, since it is larger than the sum of its proper divisors (1).
150476015251 is an equidigital number, since it uses as much as digits as its factorization.
150476015251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42000, while the sum is 37.
The spelling of 150476015251 in words is "one hundred fifty billion, four hundred seventy-six million, fifteen thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.246 sec. • engine limits •