Base | Representation |
---|---|
bin | 100010001010010011001001… |
… | …010111100010010010011101 |
3 | 201200221221010220201202221012 |
4 | 202022103021113202102131 |
5 | 124143023223101414003 |
6 | 1251311525521545005 |
7 | 43434402216302531 |
oct | 4212231127422235 |
9 | 650857126652835 |
10 | 150241334404253 |
11 | 43964aa0540134 |
12 | 14a2593aaa5165 |
13 | 65aa90a530151 |
14 | 2915a0ddc3bc1 |
15 | 12581c65c48d8 |
hex | 88a4c95e249d |
150241334404253 has 2 divisors, whose sum is σ = 150241334404254. Its totient is φ = 150241334404252.
The previous prime is 150241334404229. The next prime is 150241334404303. The reversal of 150241334404253 is 352404433142051.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 89995996970884 + 60245337433369 = 9486622^2 + 7761787^2 .
It is a cyclic number.
It is not a de Polignac number, because 150241334404253 - 216 = 150241334338717 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 150241334404253.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150241334404453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75120667202126 + 75120667202127.
It is an arithmetic number, because the mean of its divisors is an integer number (75120667202127).
Almost surely, 2150241334404253 is an apocalyptic number.
It is an amenable number.
150241334404253 is a deficient number, since it is larger than the sum of its proper divisors (1).
150241334404253 is an equidigital number, since it uses as much as digits as its factorization.
150241334404253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 691200, while the sum is 41.
The spelling of 150241334404253 in words is "one hundred fifty trillion, two hundred forty-one billion, three hundred thirty-four million, four hundred four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •