Base | Representation |
---|---|
bin | 100010001011100001001010… |
… | …111110101101011110111101 |
3 | 201201020221101121112022111021 |
4 | 202023201022332231132331 |
5 | 124200411313002010323 |
6 | 1251414223110424141 |
7 | 43443426305261446 |
oct | 4213411276553675 |
9 | 651227347468437 |
10 | 150325113313213 |
11 | 43997582552473 |
12 | 14a3a020362051 |
13 | 65b579c526467 |
14 | 2919aba9a02cd |
15 | 125a47b6e505d |
hex | 88b84afad7bd |
150325113313213 has 2 divisors, whose sum is σ = 150325113313214. Its totient is φ = 150325113313212.
The previous prime is 150325113313169. The next prime is 150325113313273. The reversal of 150325113313213 is 312313311523051.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 94100340484089 + 56224772829124 = 9700533^2 + 7498318^2 .
It is a cyclic number.
It is not a de Polignac number, because 150325113313213 - 29 = 150325113312701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150325113313273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75162556656606 + 75162556656607.
It is an arithmetic number, because the mean of its divisors is an integer number (75162556656607).
Almost surely, 2150325113313213 is an apocalyptic number.
It is an amenable number.
150325113313213 is a deficient number, since it is larger than the sum of its proper divisors (1).
150325113313213 is an equidigital number, since it uses as much as digits as its factorization.
150325113313213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24300, while the sum is 34.
Adding to 150325113313213 its reverse (312313311523051), we get a palindrome (462638424836264).
The spelling of 150325113313213 in words is "one hundred fifty trillion, three hundred twenty-five billion, one hundred thirteen million, three hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •