Base | Representation |
---|---|
bin | 1000101111100101010… |
… | …1100000110011000111 |
3 | 112100201112110222120101 |
4 | 2023321111200303013 |
5 | 4430113241213330 |
6 | 153001221344531 |
7 | 13565252252056 |
oct | 2137125406307 |
9 | 470645428511 |
10 | 150212054215 |
11 | 58782874673 |
12 | 25141868147 |
13 | 1121b497322 |
14 | 73ad9d039d |
15 | 3d9251a4ca |
hex | 22f9560cc7 |
150212054215 has 8 divisors (see below), whose sum is σ = 181041603840. Its totient is φ = 119644884192.
The previous prime is 150212054143. The next prime is 150212054257. The reversal of 150212054215 is 512450212051.
150212054215 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 150212054215 - 221 = 150209957063 is a prime.
It is a super-2 number, since 2×1502120542152 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65593639 + ... + 65595928.
It is an arithmetic number, because the mean of its divisors is an integer number (22630200480).
Almost surely, 2150212054215 is an apocalyptic number.
150212054215 is a deficient number, since it is larger than the sum of its proper divisors (30829549625).
150212054215 is a wasteful number, since it uses less digits than its factorization.
150212054215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131189801.
The product of its (nonzero) digits is 4000, while the sum is 28.
Adding to 150212054215 its reverse (512450212051), we get a palindrome (662662266266).
The spelling of 150212054215 in words is "one hundred fifty billion, two hundred twelve million, fifty-four thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •