Base | Representation |
---|---|
bin | 100010001110101101010110… |
… | …000111010010111000111100 |
3 | 201202000220021010200220122211 |
4 | 202032231112013102320330 |
5 | 124213004303410220202 |
6 | 1252103041105150204 |
7 | 43465320112533664 |
oct | 4216552607227074 |
9 | 652026233626584 |
10 | 150544343445052 |
11 | 43a71552212307 |
12 | 14a7460402b364 |
13 | 660036988a36b |
14 | 2926556a031a4 |
15 | 126100d0111d7 |
hex | 88eb561d2e3c |
150544343445052 has 24 divisors (see below), whose sum is σ = 282550952451600. Its totient is φ = 69964997746176.
The previous prime is 150544343445049. The next prime is 150544343445061. The reversal of 150544343445052 is 250544343445051.
It is a happy number.
150544343445052 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 150544343444987 and 150544343445005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18687228277 + ... + 18687236332.
It is an arithmetic number, because the mean of its divisors is an integer number (11772956352150).
Almost surely, 2150544343445052 is an apocalyptic number.
It is an amenable number.
150544343445052 is a deficient number, since it is larger than the sum of its proper divisors (132006609006548).
150544343445052 is a wasteful number, since it uses less digits than its factorization.
150544343445052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37374464685 (or 37374464683 counting only the distinct ones).
The product of its (nonzero) digits is 11520000, while the sum is 49.
Subtracting 150544343445052 from its reverse (250544343445051), we obtain a palindrome (99999999999999).
The spelling of 150544343445052 in words is "one hundred fifty trillion, five hundred forty-four billion, three hundred forty-three million, four hundred forty-five thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •