Base | Representation |
---|---|
bin | 1000110000101010000… |
… | …0010100110111100001 |
3 | 112101110121111022022002 |
4 | 2030022200110313201 |
5 | 4431211011222401 |
6 | 153045551253345 |
7 | 13605350520263 |
oct | 2141240246741 |
9 | 471417438262 |
10 | 150500101601 |
11 | 58910424963 |
12 | 2520221a255 |
13 | 1126606b875 |
14 | 73d9d71b33 |
15 | 3dac967a6b |
hex | 230a814de1 |
150500101601 has 8 divisors (see below), whose sum is σ = 167740051680. Its totient is φ = 134192040768.
The previous prime is 150500101589. The next prime is 150500101621. The reversal of 150500101601 is 106101005051.
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 150500101601 - 26 = 150500101537 is a prime.
It is a super-2 number, since 2×1505001016012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (150500101621) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 232971971 + ... + 232972616.
It is an arithmetic number, because the mean of its divisors is an integer number (20967506460).
Almost surely, 2150500101601 is an apocalyptic number.
It is an amenable number.
150500101601 is a deficient number, since it is larger than the sum of its proper divisors (17239950079).
150500101601 is a wasteful number, since it uses less digits than its factorization.
150500101601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 465944623.
The product of its (nonzero) digits is 150, while the sum is 20.
Adding to 150500101601 its reverse (106101005051), we get a palindrome (256601106652).
The spelling of 150500101601 in words is "one hundred fifty billion, five hundred million, one hundred one thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •