Base | Representation |
---|---|
bin | 110100100011000110001010… |
… | …000110101010011110101101 |
3 | 1010022021220212001111210001001 |
4 | 310203012022012222132231 |
5 | 220243002203312430013 |
6 | 2135310322113520301 |
7 | 66452106335211022 |
oct | 6443061206523655 |
9 | 1108256761453031 |
10 | 231110212233133 |
11 | 67703321858292 |
12 | 21b0685a573091 |
13 | 9bc57a4141c9c |
14 | 410db18885549 |
15 | 1baba9114addd |
hex | d2318a1aa7ad |
231110212233133 has 16 divisors (see below), whose sum is σ = 234065673789696. Its totient is φ = 228158841117760.
The previous prime is 231110212233083. The next prime is 231110212233211. The reversal of 231110212233133 is 331332212011132.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-231110212233133 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231110212233533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2444502843 + ... + 2444597383.
It is an arithmetic number, because the mean of its divisors is an integer number (14629104611856).
Almost surely, 2231110212233133 is an apocalyptic number.
It is an amenable number.
231110212233133 is a deficient number, since it is larger than the sum of its proper divisors (2955461556563).
231110212233133 is a wasteful number, since it uses less digits than its factorization.
231110212233133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115844.
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 231110212233133 its reverse (331332212011132), we get a palindrome (562442424244265).
The spelling of 231110212233133 in words is "two hundred thirty-one trillion, one hundred ten billion, two hundred twelve million, two hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •