Base | Representation |
---|---|
bin | 100010001010010010001110… |
… | …001100000001011101000001 |
3 | 201200221211120201110120002202 |
4 | 202022102032030001131001 |
5 | 124143014204412433213 |
6 | 1251311243213122545 |
7 | 43434335502101630 |
oct | 4212221614013501 |
9 | 650854521416082 |
10 | 150240341530433 |
11 | 43964631044360 |
12 | 14a25702489455 |
13 | 65aa7ac91974b |
14 | 29159581ad517 |
15 | 125816934eb58 |
hex | 88a48e301741 |
150240341530433 has 32 divisors (see below), whose sum is σ = 203168365924608. Its totient is φ = 107496489830400.
The previous prime is 150240341530381. The next prime is 150240341530469. The reversal of 150240341530433 is 334035143042051.
It is not a de Polignac number, because 150240341530433 - 26 = 150240341530369 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (150240341532433) 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 31 ways as a sum of consecutive naturals, for example, 1399640210 + ... + 1399747547.
It is an arithmetic number, because the mean of its divisors is an integer number (6349011435144).
Almost surely, 2150240341530433 is an apocalyptic number.
It is an amenable number.
150240341530433 is a deficient number, since it is larger than the sum of its proper divisors (52928024394175).
150240341530433 is a wasteful number, since it uses less digits than its factorization.
150240341530433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2799387833.
The product of its (nonzero) digits is 259200, while the sum is 38.
Adding to 150240341530433 its reverse (334035143042051), we get a palindrome (484275484572484).
The spelling of 150240341530433 in words is "one hundred fifty trillion, two hundred forty billion, three hundred forty-one million, five hundred thirty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •