Base | Representation |
---|---|
bin | 110100100100011001111111… |
… | …000110110000000111000000 |
3 | 1010022121112011222210201021010 |
4 | 310210121333012300013000 |
5 | 220300441023314120112 |
6 | 2135415525444000520 |
7 | 66461444013605556 |
oct | 6444317706600700 |
9 | 1108545158721233 |
10 | 231200222020032 |
11 | 67738510a53421 |
12 | 21b2019a690140 |
13 | 9c01119cacb15 |
14 | 4114216badbd6 |
15 | 1bae0ad2ac63c |
hex | d2467f1b01c0 |
231200222020032 has 56 divisors (see below), whose sum is σ = 622085343177600. Its totient is φ = 75760524726016.
The previous prime is 231200222020021. The next prime is 231200222020037. The reversal of 231200222020032 is 230020222002132.
It is a super-2 number, since 2×2312002220200322 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 231200222019990 and 231200222020008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231200222020037) 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, 10204800732 + ... + 10204823387.
Almost surely, 2231200222020032 is an apocalyptic number.
It is an amenable number.
231200222020032 is an abundant number, since it is smaller than the sum of its proper divisors (390885121157568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
231200222020032 is a wasteful number, since it uses less digits than its factorization.
231200222020032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20409624193 (or 20409624183 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 231200222020032 its reverse (230020222002132), we get a palindrome (461220444022164).
The spelling of 231200222020032 in words is "two hundred thirty-one trillion, two hundred billion, two hundred twenty-two million, twenty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •