Base | Representation |
---|---|
bin | 110100110111010110100000… |
… | …001011111110111011111111 |
3 | 1010111012222200201222221000212 |
4 | 310313112200023332323333 |
5 | 220433303401421132203 |
6 | 2142254003020343035 |
7 | 66654504034135016 |
oct | 6467264013767377 |
9 | 1114188621887025 |
10 | 232502152130303 |
11 | 6809a677616a70 |
12 | 220b05843a4a7b |
13 | 9c96b21c21033 |
14 | 415b24281da7d |
15 | 1bd2dab88c1d8 |
hex | d375a02feeff |
232502152130303 has 32 divisors (see below), whose sum is σ = 258235718727168. Its totient is φ = 207576413596800.
The previous prime is 232502152130273. The next prime is 232502152130323. The reversal of 232502152130303 is 303031251205232.
It is a cyclic number.
It is not a de Polignac number, because 232502152130303 - 220 = 232502151081727 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 232502152130303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232502152130323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 65811326 + ... + 69254132.
It is an arithmetic number, because the mean of its divisors is an integer number (8069866210224).
Almost surely, 2232502152130303 is an apocalyptic number.
232502152130303 is a deficient number, since it is larger than the sum of its proper divisors (25733566596865).
232502152130303 is a wasteful number, since it uses less digits than its factorization.
232502152130303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3443423.
The product of its (nonzero) digits is 32400, while the sum is 32.
The spelling of 232502152130303 in words is "two hundred thirty-two trillion, five hundred two billion, one hundred fifty-two million, one hundred thirty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •