Base | Representation |
---|---|
bin | 1101011100100101011… |
… | …0010010100010101110 |
3 | 211002021120120111010102 |
4 | 3113021112102202232 |
5 | 12241102400031342 |
6 | 254043010311102 |
7 | 22455450623321 |
oct | 3271126224256 |
9 | 732246514112 |
10 | 231011330222 |
11 | 89a75967632 |
12 | 38931288492 |
13 | 18a2708a60a |
14 | b2769867b8 |
15 | 6020c6b832 |
hex | 35c95928ae |
231011330222 has 8 divisors (see below), whose sum is σ = 346519034976. Its totient is φ = 115504985232.
The previous prime is 231011330213. The next prime is 231011330227. The reversal of 231011330222 is 222033110132.
231011330222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 231011330194 and 231011330203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231011330227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 491618 + ... + 838874.
It is an arithmetic number, because the mean of its divisors is an integer number (43314879372).
Almost surely, 2231011330222 is an apocalyptic number.
231011330222 is a deficient number, since it is larger than the sum of its proper divisors (115507704754).
231011330222 is a wasteful number, since it uses less digits than its factorization.
231011330222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 679882.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 231011330222 its reverse (222033110132), we get a palindrome (453044440354).
The spelling of 231011330222 in words is "two hundred thirty-one billion, eleven million, three hundred thirty thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •