Base | Representation |
---|---|
bin | 11001000001000011000001… |
… | …001000001011101011111011 |
3 | 112102120002220120102111201221 |
4 | 121001003001020023223323 |
5 | 103410104323313331133 |
6 | 1025555531421052511 |
7 | 32113623352633444 |
oct | 3101030110135373 |
9 | 472502816374657 |
10 | 110023122402043 |
11 | 320695a9332074 |
12 | 1040b2750b7137 |
13 | 495119c818966 |
14 | 1d2520cbb22cb |
15 | cabe4964ea2d |
hex | 6410c120bafb |
110023122402043 has 4 divisors (see below), whose sum is σ = 110033136349720. Its totient is φ = 110013108454368.
The previous prime is 110023122402019. The next prime is 110023122402131. The reversal of 110023122402043 is 340204221320011.
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 110023122402043 - 213 = 110023122393851 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110023122401999 and 110023122402017.
It is not an unprimeable number, because it can be changed into a prime (110023122402143) 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, 5006957358 + ... + 5006979331.
It is an arithmetic number, because the mean of its divisors is an integer number (27508284087430).
Almost surely, 2110023122402043 is an apocalyptic number.
110023122402043 is a deficient number, since it is larger than the sum of its proper divisors (10013947677).
110023122402043 is a wasteful number, since it uses less digits than its factorization.
110023122402043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10013947676.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 110023122402043 its reverse (340204221320011), we get a palindrome (450227343722054).
The spelling of 110023122402043 in words is "one hundred ten trillion, twenty-three billion, one hundred twenty-two million, four hundred two thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •