Base | Representation |
---|---|
bin | 11110111001011010011… |
… | …111101110100110101110 |
3 | 21111222102200210201021011 |
4 | 132321122133232212232 |
5 | 234241334410023042 |
6 | 4303222132455434 |
7 | 306253446110461 |
oct | 36713237564656 |
9 | 7458380721234 |
10 | 2123232111022 |
11 | 7495041a0840 |
12 | 2a35b617a57a |
13 | 1252b2251069 |
14 | 74a9d17d2d8 |
15 | 3a36bac5a17 |
hex | 1ee5a7ee9ae |
2123232111022 has 64 divisors (see below), whose sum is σ = 3584209305600. Its totient is φ = 934975802880.
The previous prime is 2123232111019. The next prime is 2123232111083. The reversal of 2123232111022 is 2201112323212.
It is a super-3 number, since 3×21232321110223 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 2123232110984 and 2123232111002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 165754554 + ... + 165767362.
It is an arithmetic number, because the mean of its divisors is an integer number (56003270400).
Almost surely, 22123232111022 is an apocalyptic number.
2123232111022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2123232111022 is a deficient number, since it is larger than the sum of its proper divisors (1460977194578).
2123232111022 is a wasteful number, since it uses less digits than its factorization.
2123232111022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14281.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 2123232111022 its reverse (2201112323212), we get a palindrome (4324344434234).
The spelling of 2123232111022 in words is "two trillion, one hundred twenty-three billion, two hundred thirty-two million, one hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •