Base | Representation |
---|---|
bin | 1000110000110001001… |
… | …1000000010100101111 |
3 | 112101112201001122011211 |
4 | 2030030103000110233 |
5 | 4431241210222030 |
6 | 153052543455251 |
7 | 13606164165640 |
oct | 2141423002457 |
9 | 471481048154 |
10 | 150530164015 |
11 | 58926398230 |
12 | 252102b7527 |
13 | 1126c36608a |
14 | 73ddd596c7 |
15 | 3db040512a |
hex | 230c4c052f |
150530164015 has 128 divisors (see below), whose sum is σ = 234043084800. Its totient is φ = 90234777600.
The previous prime is 150530164013. The next prime is 150530164021. The reversal of 150530164015 is 510461035051.
It is a happy number.
It is not a de Polignac number, because 150530164015 - 21 = 150530164013 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150530164013) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 543430057 + ... + 543430333.
It is an arithmetic number, because the mean of its divisors is an integer number (1828461600).
Almost surely, 2150530164015 is an apocalyptic number.
150530164015 is a deficient number, since it is larger than the sum of its proper divisors (83512920785).
150530164015 is a wasteful number, since it uses less digits than its factorization.
150530164015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 713.
The product of its (nonzero) digits is 9000, while the sum is 31.
Adding to 150530164015 its reverse (510461035051), we get a palindrome (660991199066).
The spelling of 150530164015 in words is "one hundred fifty billion, five hundred thirty million, one hundred sixty-four thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •