Base | Representation |
---|---|
bin | 11001000001010010110000… |
… | …111010011110100110010110 |
3 | 112102121201112220111211111220 |
4 | 121001102300322132212112 |
5 | 103410343440220240342 |
6 | 1030011405250511210 |
7 | 32115062350131162 |
oct | 3101226072364626 |
9 | 472551486454456 |
10 | 110040030243222 |
11 | 32075795375432 |
12 | 104125b3595506 |
13 | 49529656b2601 |
14 | 1d25d74541ca2 |
15 | cac5d8bc05ec |
hex | 6414b0e9e996 |
110040030243222 has 8 divisors (see below), whose sum is σ = 220080060486456. Its totient is φ = 36680010081072.
The previous prime is 110040030243197. The next prime is 110040030243251. The reversal of 110040030243222 is 222342030040011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
110040030243222 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 110040030243192 and 110040030243201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9170002520263 + ... + 9170002520274.
It is an arithmetic number, because the mean of its divisors is an integer number (27510007560807).
Almost surely, 2110040030243222 is an apocalyptic number.
110040030243222 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110040030243222 is a wasteful number, since it uses less digits than its factorization.
110040030243222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18340005040542.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 110040030243222 its reverse (222342030040011), we get a palindrome (332382060283233).
The spelling of 110040030243222 in words is "one hundred ten trillion, forty billion, thirty million, two hundred forty-three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •