Base | Representation |
---|---|
bin | 11010001001100111011010… |
… | …110110100001100010001010 |
3 | 120002012211221102010222012020 |
4 | 122021213122312201202022 |
5 | 110033311000304324320 |
6 | 1044334511503025310 |
7 | 33140125200464430 |
oct | 3211473266414212 |
9 | 502184842128166 |
10 | 115010011011210 |
11 | 33711520a02637 |
12 | 10a95863b9b236 |
13 | 4c23522409aa3 |
14 | 205872b0b4d50 |
15 | d46a1ac69940 |
hex | 6899dada188a |
115010011011210 has 128 divisors (see below), whose sum is σ = 315664091781120. Its totient is φ = 26270667719424.
The previous prime is 115010011011199. The next prime is 115010011011229. The reversal of 115010011011210 is 12110110010511.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 115010011011210.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4746779376 + ... + 4746803604.
It is an arithmetic number, because the mean of its divisors is an integer number (2466125717040).
Almost surely, 2115010011011210 is an apocalyptic number.
115010011011210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
115010011011210 is an abundant number, since it is smaller than the sum of its proper divisors (200654080769910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115010011011210 is a wasteful number, since it uses less digits than its factorization.
115010011011210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38220.
The product of its (nonzero) digits is 10, while the sum is 15.
Adding to 115010011011210 its reverse (12110110010511), we get a palindrome (127120121021721).
The spelling of 115010011011210 in words is "one hundred fifteen trillion, ten billion, eleven million, eleven thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •