Base | Representation |
---|---|
bin | 110100110111010111011111… |
… | …111101111111011001101101 |
3 | 1010111020002110022112022012111 |
4 | 310313113133331333121231 |
5 | 220433313044341012023 |
6 | 2142254301124004021 |
7 | 66654542406460315 |
oct | 6467273775773155 |
9 | 1114202408468174 |
10 | 232503222204013 |
11 | 680a0076651202 |
12 | 220b0822830611 |
13 | 9c96c62824447 |
14 | 415b3049ac445 |
15 | 1bd2e207b100d |
hex | d375dff7f66d |
232503222204013 has 8 divisors (see below), whose sum is σ = 232642212566400. Its totient is φ = 232364249737920.
The previous prime is 232503222203983. The next prime is 232503222204053. The reversal of 232503222204013 is 310402222305232.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-232503222204013 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 (232503222204053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21562348 + ... + 30494938.
It is an arithmetic number, because the mean of its divisors is an integer number (29080276570800).
Almost surely, 2232503222204013 is an apocalyptic number.
It is an amenable number.
232503222204013 is a deficient number, since it is larger than the sum of its proper divisors (138990362387).
232503222204013 is a wasteful number, since it uses less digits than its factorization.
232503222204013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8948147.
The product of its (nonzero) digits is 34560, while the sum is 31.
Adding to 232503222204013 its reverse (310402222305232), we get a palindrome (542905444509245).
The spelling of 232503222204013 in words is "two hundred thirty-two trillion, five hundred three billion, two hundred twenty-two million, two hundred four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •