Base | Representation |
---|---|
bin | 110100100100110101101110… |
… | …110011001000001010111010 |
3 | 1010022201101002012012000221022 |
4 | 310210311232303020022322 |
5 | 220301433031340230242 |
6 | 2135441333540342442 |
7 | 66463550166551636 |
oct | 6444655663101272 |
9 | 1108641065160838 |
10 | 231230013211322 |
11 | 6774a109338374 |
12 | 21b25b136a4a22 |
13 | 9c03b87025368 |
14 | 41158415c1dc6 |
15 | 1baec538dc0d2 |
hex | d24d6ecc82ba |
231230013211322 has 32 divisors (see below), whose sum is σ = 348066578414592. Its totient is φ = 115208666141184.
The previous prime is 231230013211313. The next prime is 231230013211331. The reversal of 231230013211322 is 223112310032132.
231230013211322 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (231230013211313) and next prime (231230013211331).
It is a junction number, because it is equal to n+sod(n) for n = 231230013211291 and 231230013211300.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2175676448 + ... + 2175782724.
It is an arithmetic number, because the mean of its divisors is an integer number (10877080575456).
Almost surely, 2231230013211322 is an apocalyptic number.
231230013211322 is a deficient number, since it is larger than the sum of its proper divisors (116836565203270).
231230013211322 is a wasteful number, since it uses less digits than its factorization.
231230013211322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 110222.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 231230013211322 its reverse (223112310032132), we get a palindrome (454342323243454).
The spelling of 231230013211322 in words is "two hundred thirty-one trillion, two hundred thirty billion, thirteen million, two hundred eleven thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •