Base | Representation |
---|---|
bin | 101101101011000… |
… | …1011010110100011 |
3 | 10221210202010002201 |
4 | 1123112023112203 |
5 | 11114312242243 |
6 | 412023354031 |
7 | 52656243406 |
oct | 13326132643 |
9 | 3853663081 |
10 | 1532540323 |
11 | 717096256 |
12 | 3692b2917 |
13 | 1b56765c2 |
14 | 107773d3d |
15 | 8e82604d |
hex | 5b58b5a3 |
1532540323 has 4 divisors (see below), whose sum is σ = 1613200360. Its totient is φ = 1451880288.
The previous prime is 1532540299. The next prime is 1532540363. The reversal of 1532540323 is 3230452351.
It is a semiprime because it is the product of two primes.
It is a de Polignac number, because none of the positive numbers 2k-1532540323 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1532540291 and 1532540300.
It is not an unprimeable number, because it can be changed into a prime (1532540363) 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, 40329990 + ... + 40330027.
It is an arithmetic number, because the mean of its divisors is an integer number (403300090).
Almost surely, 21532540323 is an apocalyptic number.
1532540323 is a deficient number, since it is larger than the sum of its proper divisors (80660037).
1532540323 is an equidigital number, since it uses as much as digits as its factorization.
1532540323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80660036.
The product of its (nonzero) digits is 10800, while the sum is 28.
The square root of 1532540323 is about 39147.6732769650. The cubic root of 1532540323 is about 1152.9327346085.
Adding to 1532540323 its reverse (3230452351), we get a palindrome (4762992674).
The spelling of 1532540323 in words is "one billion, five hundred thirty-two million, five hundred forty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •