Base | Representation |
---|---|
bin | 100001101010010101101… |
… | …001111101111111001000 |
3 | 22012010210002221112221122 |
4 | 201222111221331333020 |
5 | 300344420010242412 |
6 | 4530400524454412 |
7 | 326060221611503 |
oct | 41522551757710 |
9 | 8163702845848 |
10 | 2313203212232 |
11 | 8120299a9930 |
12 | 3143930aa408 |
13 | 13a1988a50a3 |
14 | 7dd6133813a |
15 | 4028987e572 |
hex | 21a95a7dfc8 |
2313203212232 has 64 divisors (see below), whose sum is σ = 5026998628800. Its totient is φ = 987761053440.
The previous prime is 2313203212207. The next prime is 2313203212237. The reversal of 2313203212232 is 2322123023132.
It is not an unprimeable number, because it can be changed into a prime (2313203212237) 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, 12154598 + ... + 12343445.
It is an arithmetic number, because the mean of its divisors is an integer number (78546853575).
Almost surely, 22313203212232 is an apocalyptic number.
2313203212232 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2313203212232 is an abundant number, since it is smaller than the sum of its proper divisors (2713795416568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2313203212232 is a wasteful number, since it uses less digits than its factorization.
2313203212232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24498126 (or 24498122 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 2313203212232 its reverse (2322123023132), we get a palindrome (4635326235364).
The spelling of 2313203212232 in words is "two trillion, three hundred thirteen billion, two hundred three million, two hundred twelve thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •