Base | Representation |
---|---|
bin | 110100100011010000011001… |
… | …001010011101000011110110 |
3 | 1010022022222012222021011222222 |
4 | 310203100121022131003312 |
5 | 220243142210242200342 |
6 | 2135315340425122342 |
7 | 66452645564235500 |
oct | 6443203112350366 |
9 | 1108288188234888 |
10 | 231121202303222 |
11 | 67707a51423640 |
12 | 21b08a070293b2 |
13 | 9bc6835ca093a |
14 | 411047c2ccd70 |
15 | 1babed5dc7ed2 |
hex | d2341929d0f6 |
231121202303222 has 384 divisors, whose sum is σ = 476688293125632. Its totient is φ = 82801298227200.
The previous prime is 231121202303203. The next prime is 231121202303261. The reversal of 231121202303222 is 222303202121132.
It is a junction number, because it is equal to n+sod(n) for n = 231121202303191 and 231121202303200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 58556167853 + ... + 58556171799.
It is an arithmetic number, because the mean of its divisors is an integer number (1241375763348).
Almost surely, 2231121202303222 is an apocalyptic number.
231121202303222 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
231121202303222 is an abundant number, since it is smaller than the sum of its proper divisors (245567090822410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
231121202303222 is a wasteful number, since it uses less digits than its factorization.
231121202303222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4492 (or 4485 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 231121202303222 its reverse (222303202121132), we get a palindrome (453424404424354).
The spelling of 231121202303222 in words is "two hundred thirty-one trillion, one hundred twenty-one billion, two hundred two million, three hundred three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •