Base | Representation |
---|---|
bin | 110100110000001110000110… |
… | …111111010101101001010111 |
3 | 1010102111010210101022112020021 |
4 | 310300032012333111221113 |
5 | 220402241241344111203 |
6 | 2141240515545250011 |
7 | 66604215126205522 |
oct | 6460160677255127 |
9 | 1112433711275207 |
10 | 232012103113303 |
11 | 67a20864734367 |
12 | 220315bba93907 |
13 | 9c5c85558a8a6 |
14 | 414163503dbb9 |
15 | 1bc52796835bd |
hex | d30386fd5a57 |
232012103113303 has 4 divisors (see below), whose sum is σ = 232012133931760. Its totient is φ = 232012072294848.
The previous prime is 232012103113261. The next prime is 232012103113337. The reversal of 232012103113303 is 303311301210232.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-232012103113303 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232012103114303) 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, 4208551 + ... + 21948487.
It is an arithmetic number, because the mean of its divisors is an integer number (58003033482940).
Almost surely, 2232012103113303 is an apocalyptic number.
232012103113303 is a deficient number, since it is larger than the sum of its proper divisors (30818457).
232012103113303 is a wasteful number, since it uses less digits than its factorization.
232012103113303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30818456.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 232012103113303 its reverse (303311301210232), we get a palindrome (535323404323535).
The spelling of 232012103113303 in words is "two hundred thirty-two trillion, twelve billion, one hundred three million, one hundred thirteen thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •