Base | Representation |
---|---|
bin | 100010001010010010001101… |
… | …110011001000010110110111 |
3 | 201200221211120021012001001011 |
4 | 202022102031303020112313 |
5 | 124143014201230130421 |
6 | 1251311242421213051 |
7 | 43434335362453441 |
oct | 4212221563102667 |
9 | 650854507161034 |
10 | 150240335005111 |
11 | 4396462839782a |
12 | 14a25700261187 |
13 | 65aa7ab473600 |
14 | 2915957391491 |
15 | 12581689b14e1 |
hex | 88a48dcc85b7 |
150240335005111 has 6 divisors (see below), whose sum is σ = 162686279916960. Its totient is φ = 138683386158408.
The previous prime is 150240335005069. The next prime is 150240335005129. The reversal of 150240335005111 is 111500533042051.
It is not a de Polignac number, because 150240335005111 - 229 = 150239798134199 is a prime.
It is a super-2 number, since 2×1502403350051112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150240335005141) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 444498032391 + ... + 444498032728.
It is an arithmetic number, because the mean of its divisors is an integer number (27114379986160).
Almost surely, 2150240335005111 is an apocalyptic number.
150240335005111 is a deficient number, since it is larger than the sum of its proper divisors (12445944911849).
150240335005111 is an equidigital number, since it uses as much as digits as its factorization.
150240335005111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 888996065145 (or 888996065132 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 31.
Adding to 150240335005111 its reverse (111500533042051), we get a palindrome (261740868047162).
The spelling of 150240335005111 in words is "one hundred fifty trillion, two hundred forty billion, three hundred thirty-five million, five thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •