Base | Representation |
---|---|
bin | 1000101111100111011… |
… | …1110110011111000001 |
3 | 112100202011102022121111 |
4 | 2023321313312133001 |
5 | 4430123042242222 |
6 | 153002142323321 |
7 | 13565421623131 |
oct | 2137167663701 |
9 | 470664368544 |
10 | 150221055937 |
11 | 58787962807 |
12 | 25144889541 |
13 | 112202c96a4 |
14 | 73b0c94ac1 |
15 | 3d931e7777 |
hex | 22f9df67c1 |
150221055937 has 16 divisors (see below), whose sum is σ = 152695065600. Its totient is φ = 147765784320.
The previous prime is 150221055899. The next prime is 150221055949. The reversal of 150221055937 is 739550122051.
It is not a de Polignac number, because 150221055937 - 231 = 148073572289 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 150221055937.
It is not an unprimeable number, because it can be changed into a prime (150221055967) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26181733 + ... + 26187469.
It is an arithmetic number, because the mean of its divisors is an integer number (9543441600).
Almost surely, 2150221055937 is an apocalyptic number.
It is an amenable number.
150221055937 is a deficient number, since it is larger than the sum of its proper divisors (2474009663).
150221055937 is a wasteful number, since it uses less digits than its factorization.
150221055937 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7296.
The product of its (nonzero) digits is 94500, while the sum is 40.
Adding to 150221055937 its reverse (739550122051), we get a palindrome (889771177988).
The spelling of 150221055937 in words is "one hundred fifty billion, two hundred twenty-one million, fifty-five thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •