Base | Representation |
---|---|
bin | 1000110000010010011… |
… | …1100101101110000101 |
3 | 112101012201122211001201 |
4 | 2030010213211232011 |
5 | 4431010220423331 |
6 | 153032102422501 |
7 | 13603041213355 |
oct | 2140447455605 |
9 | 471181584051 |
10 | 150401342341 |
11 | 5886a700638 |
12 | 25195131a31 |
13 | 1124b770a33 |
14 | 73cabc4b65 |
15 | 3da3e5aa61 |
hex | 23049e5b85 |
150401342341 has 2 divisors, whose sum is σ = 150401342342. Its totient is φ = 150401342340.
The previous prime is 150401342303. The next prime is 150401342407. The reversal of 150401342341 is 143243104051.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 81951085441 + 68450256900 = 286271^2 + 261630^2 .
It is an emirp because it is prime and its reverse (143243104051) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 150401342341 - 27 = 150401342213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150401342041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75200671170 + 75200671171.
It is an arithmetic number, because the mean of its divisors is an integer number (75200671171).
Almost surely, 2150401342341 is an apocalyptic number.
It is an amenable number.
150401342341 is a deficient number, since it is larger than the sum of its proper divisors (1).
150401342341 is an equidigital number, since it uses as much as digits as its factorization.
150401342341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 150401342341 its reverse (143243104051), we get a palindrome (293644446392).
The spelling of 150401342341 in words is "one hundred fifty billion, four hundred one million, three hundred forty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •