Base | Representation |
---|---|
bin | 11001000000111001110011… |
… | …100111010101001100010000 |
3 | 112102112011101021220112110112 |
4 | 121000321303213111030100 |
5 | 103404424044343310000 |
6 | 1025551214151420452 |
7 | 32113123305661304 |
oct | 3100716347251420 |
9 | 472464337815415 |
10 | 110013232010000 |
11 | 32065393481150 |
12 | 10409374984728 |
13 | 4950284757287 |
14 | 1d24951421d04 |
15 | caba6b1e3235 |
hex | 640e739d5310 |
110013232010000 has 100 divisors (see below), whose sum is σ = 290566948675344. Its totient is φ = 40004811600000.
The previous prime is 110013232009973. The next prime is 110013232010009. The reversal of 110013232010000 is 10232310011.
It is a tau number, because it is divible by the number of its divisors (100).
It is a super-2 number, since 2×1100132320100002 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110013232010009) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 499950146 + ... + 500170145.
Almost surely, 2110013232010000 is an apocalyptic number.
110013232010000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110013232010000 is an abundant number, since it is smaller than the sum of its proper divisors (180553716665344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110013232010000 is a wasteful number, since it uses less digits than its factorization.
110013232010000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000120330 (or 1000120309 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 110013232010000 its reverse (10232310011), we get a palindrome (110023464320011).
The spelling of 110013232010000 in words is "one hundred ten trillion, thirteen billion, two hundred thirty-two million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.993 sec. • engine limits •