Base | Representation |
---|---|
bin | 110100110100011101010100… |
… | …111100111111100111110111 |
3 | 1010110111222110212221000102001 |
4 | 310310131110330333213313 |
5 | 220422024200240223020 |
6 | 2142022401140200131 |
7 | 66634234602005536 |
oct | 6464352474774767 |
9 | 1113458425830361 |
10 | 232303321414135 |
11 | 68023315892044 |
12 | 22079b34399047 |
13 | 9c81155c303aa |
14 | 415177db5431d |
15 | 1bccb20dd750a |
hex | d34754f3f9f7 |
232303321414135 has 32 divisors (see below), whose sum is σ = 297622543897152. Its totient is φ = 173455187189760.
The previous prime is 232303321414123. The next prime is 232303321414243. The reversal of 232303321414135 is 531414123303232.
It is not a de Polignac number, because 232303321414135 - 223 = 232303313025527 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 232303321414094 and 232303321414103.
It is a congruent number.
It is an unprimeable number.
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, 1035019 + ... + 21579571.
It is an arithmetic number, because the mean of its divisors is an integer number (9300704496786).
Almost surely, 2232303321414135 is an apocalyptic number.
232303321414135 is a deficient number, since it is larger than the sum of its proper divisors (65319222483017).
232303321414135 is a wasteful number, since it uses less digits than its factorization.
232303321414135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20545683.
The product of its (nonzero) digits is 155520, while the sum is 37.
Adding to 232303321414135 its reverse (531414123303232), we get a palindrome (763717444717367).
The spelling of 232303321414135 in words is "two hundred thirty-two trillion, three hundred three billion, three hundred twenty-one million, four hundred fourteen thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •