Base | Representation |
---|---|
bin | 110100100101111001111010… |
… | …010100110000010101110111 |
3 | 1010022222101001011121001002120 |
4 | 310211321322110300111313 |
5 | 220304132444040120043 |
6 | 2135535122142011023 |
7 | 66502051304633355 |
oct | 6445717224602567 |
9 | 1108871034531076 |
10 | 231303221020023 |
11 | 67778166226609 |
12 | 21b38144876a73 |
13 | 9c0aa52c13869 |
14 | 41191c82567d5 |
15 | 1bb1ada93e983 |
hex | d25e7a530577 |
231303221020023 has 8 divisors (see below), whose sum is σ = 308405668297200. Its totient is φ = 154201460544768.
The previous prime is 231303221019979. The next prime is 231303221020057. The reversal of 231303221020023 is 320020122303132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 231303221020023 - 224 = 231303204242807 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 231303221019975 and 231303221020002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231303221022023) 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, 170914138 + ... + 172262151.
It is an arithmetic number, because the mean of its divisors is an integer number (38550708537150).
Almost surely, 2231303221020023 is an apocalyptic number.
231303221020023 is a deficient number, since it is larger than the sum of its proper divisors (77102447277177).
231303221020023 is a wasteful number, since it uses less digits than its factorization.
231303221020023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 343400961.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 231303221020023 its reverse (320020122303132), we get a palindrome (551323343323155).
The spelling of 231303221020023 in words is "two hundred thirty-one trillion, three hundred three billion, two hundred twenty-one million, twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •