Base | Representation |
---|---|
bin | 1000111000001110100… |
… | …1011100011100000011 |
3 | 112120201020212121211202 |
4 | 2032003221130130003 |
5 | 4444341312110133 |
6 | 154023353331415 |
7 | 14006620104230 |
oct | 2160351343403 |
9 | 476636777752 |
10 | 152532535043 |
11 | 59763704219 |
12 | 2568aa06b6b |
13 | 114cb1606c5 |
14 | 754dc70787 |
15 | 3e7b0d52e8 |
hex | 2383a5c703 |
152532535043 has 4 divisors (see below), whose sum is σ = 174322897200. Its totient is φ = 130742172888.
The previous prime is 152532535033. The next prime is 152532535069. The reversal of 152532535043 is 340535235251.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 340535235251 = 29 ⋅11742594319.
It is a cyclic number.
It is not a de Polignac number, because 152532535043 - 212 = 152532530947 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 152532534988 and 152532535006.
It is not an unprimeable number, because it can be changed into a prime (152532535033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10895181068 + ... + 10895181081.
It is an arithmetic number, because the mean of its divisors is an integer number (43580724300).
Almost surely, 2152532535043 is an apocalyptic number.
152532535043 is a deficient number, since it is larger than the sum of its proper divisors (21790362157).
152532535043 is an equidigital number, since it uses as much as digits as its factorization.
152532535043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21790362156.
The product of its (nonzero) digits is 270000, while the sum is 38.
The spelling of 152532535043 in words is "one hundred fifty-two billion, five hundred thirty-two million, five hundred thirty-five thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •