Base | Representation |
---|---|
bin | 11110111000101010101… |
… | …110010111110000110100 |
3 | 21111220100211200221011200 |
4 | 132320222232113300310 |
5 | 234233214221041002 |
6 | 4303010422332500 |
7 | 306224544541653 |
oct | 36705256276064 |
9 | 7456324627150 |
10 | 2122430643252 |
11 | 749132848187 |
12 | 2a341188a130 |
13 | 1251b51a608a |
14 | 74a2495119a |
15 | 3a32155db1c |
hex | 1ee2ab97c34 |
2122430643252 has 36 divisors (see below), whose sum is σ = 5370948238656. Its totient is φ = 706696851600.
The previous prime is 2122430643241. The next prime is 2122430643293. The reversal of 2122430643252 is 2523460342212.
2122430643252 is a `hidden beast` number, since 2 + 1 + 2 + 2 + 4 + 3 + 0 + 643 + 2 + 5 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 32468124 + ... + 32533427.
Almost surely, 22122430643252 is an apocalyptic number.
It is an amenable number.
2122430643252 is an abundant number, since it is smaller than the sum of its proper divisors (3248517595404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2122430643252 is a wasteful number, since it uses less digits than its factorization.
2122430643252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65002468 (or 65002463 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 36.
Adding to 2122430643252 its reverse (2523460342212), we get a palindrome (4645890985464).
The spelling of 2122430643252 in words is "two trillion, one hundred twenty-two billion, four hundred thirty million, six hundred forty-three thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •