Base | Representation |
---|---|
bin | 1010000110101100110101… |
… | …1111011100110000110110 |
3 | 1110100010110020111022222200 |
4 | 2201223031133130300312 |
5 | 2424012224122013024 |
6 | 35343545351205330 |
7 | 2224454634216120 |
oct | 241531537346066 |
9 | 43303406438880 |
10 | 11110233001014 |
11 | 35a3906982144 |
12 | 12b52a2676846 |
13 | 6278c8c91184 |
14 | 2a5a4968c210 |
15 | 144008e792c9 |
hex | a1acd7dcc36 |
11110233001014 has 24 divisors (see below), whose sum is σ = 27511053145680. Its totient is φ = 3174352285968.
The previous prime is 11110233001013. The next prime is 11110233001031. The reversal of 11110233001014 is 41010033201111.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11110233001013) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 44088226069 + ... + 44088226320.
It is an arithmetic number, because the mean of its divisors is an integer number (1146293881070).
Almost surely, 211110233001014 is an apocalyptic number.
11110233001014 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
11110233001014 is an abundant number, since it is smaller than the sum of its proper divisors (16400820144666).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11110233001014 is a wasteful number, since it uses less digits than its factorization.
11110233001014 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88176452404 (or 88176452401 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 11110233001014 its reverse (41010033201111), we get a palindrome (52120266202125).
The spelling of 11110233001014 in words is "eleven trillion, one hundred ten billion, two hundred thirty-three million, one thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •