Base | Representation |
---|---|
bin | 110100100100110101101110… |
… | …110011001000010101110111 |
3 | 1010022201101002012012001220021 |
4 | 310210311232303020111313 |
5 | 220301433031340241043 |
6 | 2135441333540350011 |
7 | 66463550166553660 |
oct | 6444655663102567 |
9 | 1108641065161807 |
10 | 231230013212023 |
11 | 6774a109338951 |
12 | 21b25b136a5307 |
13 | 9c03b87025787 |
14 | 41158415c2367 |
15 | 1baec538dc3ed |
hex | d24d6ecc8577 |
231230013212023 has 8 divisors (see below), whose sum is σ = 266343682260992. Its totient is φ = 196636546667736.
The previous prime is 231230013211999. The next prime is 231230013212057. The reversal of 231230013212023 is 320212310032132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 231230013212023 - 213 = 231230013203831 is a prime.
It is a super-2 number, since 2×2312300132120232 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231230013212323) 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, 130050625215 + ... + 130050626992.
It is an arithmetic number, because the mean of its divisors is an integer number (33292960282624).
Almost surely, 2231230013212023 is an apocalyptic number.
231230013212023 is a deficient number, since it is larger than the sum of its proper divisors (35113669048969).
231230013212023 is a wasteful number, since it uses less digits than its factorization.
231230013212023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 260101252341.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 231230013212023 its reverse (320212310032132), we get a palindrome (551442323244155).
The spelling of 231230013212023 in words is "two hundred thirty-one trillion, two hundred thirty billion, thirteen million, two hundred twelve thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •