Base | Representation |
---|---|
bin | 10000000000100100011… |
… | …001010001011000000001 |
3 | 10220011121102001210221202 |
4 | 100000210121101120001 |
5 | 121011022242413241 |
6 | 2201220021230545 |
7 | 142324024454000 |
oct | 20004431213001 |
9 | 3804542053852 |
10 | 1100122232321 |
11 | 394617357a42 |
12 | 159264862455 |
13 | 7c9832042a8 |
14 | 3b363804c37 |
15 | 1d93b597d9b |
hex | 10024651601 |
1100122232321 has 8 divisors (see below), whose sum is σ = 1282941379200. Its totient is φ = 942961913124.
The previous prime is 1100122232311. The next prime is 1100122232327. The reversal of 1100122232321 is 1232322210011.
It is not a de Polignac number, because 1100122232321 - 26 = 1100122232257 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1100122232293 and 1100122232302.
It is not an unprimeable number, because it can be changed into a prime (1100122232327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1603676381 + ... + 1603677066.
It is an arithmetic number, because the mean of its divisors is an integer number (160367672400).
Almost surely, 21100122232321 is an apocalyptic number.
It is an amenable number.
1100122232321 is a deficient number, since it is larger than the sum of its proper divisors (182819146879).
1100122232321 is an frugal number, since it uses more digits than its factorization.
1100122232321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3207353468 (or 3207353454 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 1100122232321 its reverse (1232322210011), we get a palindrome (2332444442332).
The spelling of 1100122232321 in words is "one trillion, one hundred billion, one hundred twenty-two million, two hundred thirty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •