Base | Representation |
---|---|
bin | 100010010001100110110111… |
… | …010101011000111001000000 |
3 | 201202201221102200212001120010 |
4 | 202101212313111120321000 |
5 | 124224240234003301331 |
6 | 1252334343323344520 |
7 | 43515601344165321 |
oct | 4221466725307100 |
9 | 652657380761503 |
10 | 150743543025216 |
11 | 44038a83186209 |
12 | 14aa7137682140 |
13 | 661609410a51b |
14 | 293205268a448 |
15 | 12662bb078e46 |
hex | 8919b7558e40 |
150743543025216 has 28 divisors (see below), whose sum is σ = 398842290921392. Its totient is φ = 50247847675008.
The previous prime is 150743543025211. The next prime is 150743543025259. The reversal of 150743543025216 is 612520345347051.
It is a super-2 number, since 2×1507435430252162 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (150743543025211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 392561309770 + ... + 392561310153.
Almost surely, 2150743543025216 is an apocalyptic number.
150743543025216 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
150743543025216 is an abundant number, since it is smaller than the sum of its proper divisors (248098747896176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150743543025216 is an equidigital number, since it uses as much as digits as its factorization.
150743543025216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 785122619938 (or 785122619928 counting only the distinct ones).
The product of its (nonzero) digits is 3024000, while the sum is 48.
The spelling of 150743543025216 in words is "one hundred fifty trillion, seven hundred forty-three billion, five hundred forty-three million, twenty-five thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •