Base | Representation |
---|---|
bin | 11001000011100111110101… |
… | …111100111101110100010000 |
3 | 112110012000201121100111222110 |
4 | 121003213311330331310100 |
5 | 103421004302143010412 |
6 | 1030213121134505320 |
7 | 32132460160232061 |
oct | 3103476574756420 |
9 | 473160647314873 |
10 | 110200102313232 |
11 | 32127667932888 |
12 | 10439627365240 |
13 | 4964a95863cb9 |
14 | 1d2d9db856568 |
15 | cb1856b46d3c |
hex | 6439f5f3dd10 |
110200102313232 has 40 divisors (see below), whose sum is σ = 286256435221120. Its totient is φ = 36530420653440.
The previous prime is 110200102313201. The next prime is 110200102313243. The reversal of 110200102313232 is 232313201002011.
It is a junction number, because it is equal to n+sod(n) for n = 110200102313199 and 110200102313208.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6342078232 + ... + 6342095607.
It is an arithmetic number, because the mean of its divisors is an integer number (7156410880528).
Almost surely, 2110200102313232 is an apocalyptic number.
110200102313232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
110200102313232 is an abundant number, since it is smaller than the sum of its proper divisors (176056332907888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110200102313232 is a wasteful number, since it uses less digits than its factorization.
110200102313232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12684174031 (or 12684174025 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 110200102313232 its reverse (232313201002011), we get a palindrome (342513303315243).
The spelling of 110200102313232 in words is "one hundred ten trillion, two hundred billion, one hundred two million, three hundred thirteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •