Base | Representation |
---|---|
bin | 100010001001101111100011… |
… | …001000101001111110011110 |
3 | 201200211021111010112201222012 |
4 | 202021233203020221332132 |
5 | 124141411433133134114 |
6 | 1251242205043151222 |
7 | 43431550065260000 |
oct | 4211574310517636 |
9 | 650737433481865 |
10 | 150203112005534 |
11 | 4394a866a38265 |
12 | 14a1a452375512 |
13 | 65a7128827783 |
14 | 2913c2593c370 |
15 | 12571dabbe63e |
hex | 889be3229f9e |
150203112005534 has 40 divisors (see below), whose sum is σ = 262858426483968. Its totient is φ = 64368201992640.
The previous prime is 150203112005519. The next prime is 150203112005537. The reversal of 150203112005534 is 435500211302051.
It is a super-2 number, since 2×1502031120055342 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 150203112005534.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150203112005537) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 67121174 + ... + 69322854.
Almost surely, 2150203112005534 is an apocalyptic number.
150203112005534 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
150203112005534 is a deficient number, since it is larger than the sum of its proper divisors (112655314478434).
150203112005534 is an equidigital number, since it uses as much as digits as its factorization.
150203112005534 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2215918 (or 2215897 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 32.
Adding to 150203112005534 its reverse (435500211302051), we get a palindrome (585703323307585).
The spelling of 150203112005534 in words is "one hundred fifty trillion, two hundred three billion, one hundred twelve million, five thousand, five hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •