Base | Representation |
---|---|
bin | 100010001001110001010100… |
… | …100000100101110010000111 |
3 | 201200211110101200200102012211 |
4 | 202021301110200211302013 |
5 | 124141424332102331343 |
6 | 1251243121511524251 |
7 | 43431645162663100 |
oct | 4211612440456207 |
9 | 650743350612184 |
10 | 150205014105223 |
11 | 43950652697980 |
12 | 14a1a8a3389687 |
13 | 65a736c914c4c |
14 | 2913d663d13a7 |
15 | 125729cb9479d |
hex | 889c54825c87 |
150205014105223 has 12 divisors (see below), whose sum is σ = 190612670961672. Its totient is φ = 117042868133520.
The previous prime is 150205014105217. The next prime is 150205014105253. The reversal of 150205014105223 is 322501410502051.
It is a de Polignac number, because none of the positive numbers 2k-150205014105223 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150205014105253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 139336747240 + ... + 139336748317.
It is an arithmetic number, because the mean of its divisors is an integer number (15884389246806).
Almost surely, 2150205014105223 is an apocalyptic number.
150205014105223 is a deficient number, since it is larger than the sum of its proper divisors (40407656856449).
150205014105223 is a wasteful number, since it uses less digits than its factorization.
150205014105223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 278673495582 (or 278673495575 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 31.
Adding to 150205014105223 its reverse (322501410502051), we get a palindrome (472706424607274).
The spelling of 150205014105223 in words is "one hundred fifty trillion, two hundred five billion, fourteen million, one hundred five thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •