Base | Representation |
---|---|
bin | 11001000011101000101100… |
… | …001011001100001111110111 |
3 | 112110012010002000010000010021 |
4 | 121003220230023030033313 |
5 | 103421013133033341043 |
6 | 1030213351312510011 |
7 | 32132521544444122 |
oct | 3103505413141767 |
9 | 473163060100107 |
10 | 110201012012023 |
11 | 32127a94389a69 |
12 | 1043983bb4b307 |
13 | 4964bac1750ca |
14 | 1d2da865b93b9 |
15 | cb18ab93c3ed |
hex | 643a2c2cc3f7 |
110201012012023 has 4 divisors (see below), whose sum is σ = 110204117088568. Its totient is φ = 110197906935480.
The previous prime is 110201012012009. The next prime is 110201012012059. The reversal of 110201012012023 is 320210210102011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 110201012012023 - 29 = 110201012011511 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110201012011988 and 110201012012006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110201012052023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1552485036 + ... + 1552556017.
It is an arithmetic number, because the mean of its divisors is an integer number (27551029272142).
Almost surely, 2110201012012023 is an apocalyptic number.
110201012012023 is a deficient number, since it is larger than the sum of its proper divisors (3105076545).
110201012012023 is an equidigital number, since it uses as much as digits as its factorization.
110201012012023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3105076544.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 110201012012023 its reverse (320210210102011), we get a palindrome (430411222114034).
The spelling of 110201012012023 in words is "one hundred ten trillion, two hundred one billion, twelve million, twelve thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •