Base | Representation |
---|---|
bin | 11001000001000000011110… |
… | …111111100101101100101110 |
3 | 112102112211212222221222022210 |
4 | 121001000132333211230232 |
5 | 103410033240433142202 |
6 | 1025554401450351250 |
7 | 32113466062635651 |
oct | 3101003677455456 |
9 | 472484788858283 |
10 | 110020402240302 |
11 | 32068432925314 |
12 | 1040a83612b526 |
13 | 4950b580c32b8 |
14 | 1d25031811898 |
15 | cabd3a935c6c |
hex | 64101efe5b2e |
110020402240302 has 8 divisors (see below), whose sum is σ = 220040804480616. Its totient is φ = 36673467413432.
The previous prime is 110020402240297. The next prime is 110020402240339. The reversal of 110020402240302 is 203042204020011.
110020402240302 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
110020402240302 is an admirable number.
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, 9168366853353 + ... + 9168366853364.
It is an arithmetic number, because the mean of its divisors is an integer number (27505100560077).
Almost surely, 2110020402240302 is an apocalyptic number.
110020402240302 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.
110020402240302 is a wasteful number, since it uses less digits than its factorization.
110020402240302 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18336733706722.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 110020402240302 its reverse (203042204020011), we get a palindrome (313062606260313).
The spelling of 110020402240302 in words is "one hundred ten trillion, twenty billion, four hundred two million, two hundred forty thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •