Base | Representation |
---|---|
bin | 1000110000110101111… |
… | …0111010010000100001 |
3 | 112101121002111120020102 |
4 | 2030031132322100201 |
5 | 4431311303441423 |
6 | 153054534152145 |
7 | 13606525261613 |
oct | 2141536722041 |
9 | 471532446212 |
10 | 150550062113 |
11 | 58936648a40 |
12 | 25216ab2655 |
13 | 11273511cb9 |
14 | 7402858db3 |
15 | 3db2035c28 |
hex | 230d7ba421 |
150550062113 has 8 divisors (see below), whose sum is σ = 164318124576. Its totient is φ = 136795615200.
The previous prime is 150550062109. The next prime is 150550062121. The reversal of 150550062113 is 311260055051.
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 150550062113 - 22 = 150550062109 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (150550062913) 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 in 7 ways as a sum of consecutive naturals, for example, 3380756 + ... + 3424997.
It is an arithmetic number, because the mean of its divisors is an integer number (20539765572).
Almost surely, 2150550062113 is an apocalyptic number.
It is an amenable number.
150550062113 is a deficient number, since it is larger than the sum of its proper divisors (13768062463).
150550062113 is a wasteful number, since it uses less digits than its factorization.
150550062113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6807775.
The product of its (nonzero) digits is 4500, while the sum is 29.
The spelling of 150550062113 in words is "one hundred fifty billion, five hundred fifty million, sixty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •