Base | Representation |
---|---|
bin | 1000101110110111111… |
… | …1001010010011100111 |
3 | 112100020021012012222100 |
4 | 2023231333022103213 |
5 | 4424221020124133 |
6 | 152530300303143 |
7 | 13560450642540 |
oct | 2135577122347 |
9 | 470207165870 |
10 | 150021645543 |
11 | 58695342830 |
12 | 250a9b41ab3 |
13 | 111babba883 |
14 | 73925c74c7 |
15 | 3d80957e13 |
hex | 22edfca4e7 |
150021645543 has 192 divisors, whose sum is σ = 299395160064. Its totient is φ = 69949440000.
The previous prime is 150021645523. The next prime is 150021645619. The reversal of 150021645543 is 345546120051.
150021645543 is a `hidden beast` number, since 1 + 5 + 0 + 0 + 2 + 1 + 645 + 5 + 4 + 3 = 666.
It is not a de Polignac number, because 150021645543 - 28 = 150021645287 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 150021645498 and 150021645507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150021645523) 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 191 ways as a sum of consecutive naturals, for example, 124913343 + ... + 124914543.
It is an arithmetic number, because the mean of its divisors is an integer number (1559349792).
Almost surely, 2150021645543 is an apocalyptic number.
150021645543 is a deficient number, since it is larger than the sum of its proper divisors (149373514521).
150021645543 is a wasteful number, since it uses less digits than its factorization.
150021645543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1726 (or 1723 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 36.
Adding to 150021645543 its reverse (345546120051), we get a palindrome (495567765594).
The spelling of 150021645543 in words is "one hundred fifty billion, twenty-one million, six hundred forty-five thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •