Base | Representation |
---|---|
bin | 11001000001000000010101… |
… | …100000100110100010010001 |
3 | 112102112211110220112221111020 |
4 | 121001000111200212202101 |
5 | 103410032424214403241 |
6 | 1025554334004110053 |
7 | 32113462121312100 |
oct | 3101002540464221 |
9 | 472484426487436 |
10 | 110020243122321 |
11 | 32068361025654 |
12 | 1040a7b0995329 |
13 | 4950b3115114c |
14 | 1d25018632037 |
15 | cabd2b9a4b66 |
hex | 641015826891 |
110020243122321 has 24 divisors (see below), whose sum is σ = 171012203282304. Its totient is φ = 62732924765280.
The previous prime is 110020243122313. The next prime is 110020243122323. The reversal of 110020243122321 is 123221342020011.
It is not a de Polignac number, because 110020243122321 - 23 = 110020243122313 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 110020243122291 and 110020243122300.
It is not an unprimeable number, because it can be changed into a prime (110020243122323) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 808179270 + ... + 808315391.
It is an arithmetic number, because the mean of its divisors is an integer number (7125508470096).
Almost surely, 2110020243122321 is an apocalyptic number.
It is an amenable number.
110020243122321 is a deficient number, since it is larger than the sum of its proper divisors (60991960159983).
110020243122321 is a wasteful number, since it uses less digits than its factorization.
110020243122321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1616495141 (or 1616495134 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 110020243122321 its reverse (123221342020011), we get a palindrome (233241585142332).
The spelling of 110020243122321 in words is "one hundred ten trillion, twenty billion, two hundred forty-three million, one hundred twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •