Base | Representation |
---|---|
bin | 11110111000011000110… |
… | …111110010100000111000 |
3 | 21111212120222002200120120 |
4 | 132320120313302200320 |
5 | 234232111031402412 |
6 | 4302521002453240 |
7 | 306214246625562 |
oct | 36703067624070 |
9 | 7455528080516 |
10 | 2122131122232 |
11 | 748a99770650 |
12 | 2a3349504220 |
13 | 1251681152c4 |
14 | 749d6c64332 |
15 | 3a3050e6b8c |
hex | 1ee18df2838 |
2122131122232 has 32 divisors (see below), whose sum is σ = 5787630334080. Its totient is φ = 643070036960.
The previous prime is 2122131122179. The next prime is 2122131122261. The reversal of 2122131122232 is 2322211312212.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4019187468 + ... + 4019187995.
It is an arithmetic number, because the mean of its divisors is an integer number (180863447940).
Almost surely, 22122131122232 is an apocalyptic number.
2122131122232 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2122131122232 is an abundant number, since it is smaller than the sum of its proper divisors (3665499211848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2122131122232 is a wasteful number, since it uses less digits than its factorization.
2122131122232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8038375483 (or 8038375479 counting only the distinct ones).
The product of its digits is 1152, while the sum is 24.
Adding to 2122131122232 its reverse (2322211312212), we get a palindrome (4444342434444).
The spelling of 2122131122232 in words is "two trillion, one hundred twenty-two billion, one hundred thirty-one million, one hundred twenty-two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •