Base | Representation |
---|---|
bin | 1111011111100001111… |
… | …00101111011001011111 |
3 | 1212220000112110012011211 |
4 | 13233300330233121133 |
5 | 32210144244311111 |
6 | 1044313534325251 |
7 | 53313320341456 |
oct | 7576074573137 |
9 | 1786015405154 |
10 | 532323432031 |
11 | 195836777396 |
12 | 87202059827 |
13 | 3b2759a0611 |
14 | 1ba9c079b9d |
15 | dca870b521 |
hex | 7bf0f2f65f |
532323432031 has 4 divisors (see below), whose sum is σ = 532349879392. Its totient is φ = 532296984672.
The previous prime is 532323432029. The next prime is 532323432149. The reversal of 532323432031 is 130234323235.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 532323432031 - 21 = 532323432029 is a prime.
It is a super-2 number, since 2×5323234320312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 532323431984 and 532323432002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (532323432631) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13193466 + ... + 13233751.
It is an arithmetic number, because the mean of its divisors is an integer number (133087469848).
Almost surely, 2532323432031 is an apocalyptic number.
532323432031 is a deficient number, since it is larger than the sum of its proper divisors (26447361).
532323432031 is a wasteful number, since it uses less digits than its factorization.
532323432031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26447360.
The product of its (nonzero) digits is 38880, while the sum is 31.
Adding to 532323432031 its reverse (130234323235), we get a palindrome (662557755266).
The spelling of 532323432031 in words is "five hundred thirty-two billion, three hundred twenty-three million, four hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •