Base | Representation |
---|---|
bin | 11010001010111011011100… |
… | …010100110100011010100100 |
3 | 120002112110210221011122212012 |
4 | 122022323130110310122210 |
5 | 110041300232342341200 |
6 | 1044444152110013352 |
7 | 33146500666553465 |
oct | 3212733424643244 |
9 | 502473727148765 |
10 | 115100230043300 |
11 | 33746808225787 |
12 | 10aab2421a7258 |
13 | 4c2bb9c71b048 |
14 | 205cc4910ad6c |
15 | d4904b45ea35 |
hex | 68aedc5346a4 |
115100230043300 has 36 divisors (see below), whose sum is σ = 249768234809856. Its totient is φ = 46039956420000.
The previous prime is 115100230043299. The next prime is 115100230043311. The reversal of 115100230043300 is 3340032001511.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 36771509 + ... + 39778691.
It is an arithmetic number, because the mean of its divisors is an integer number (6938006522496).
Almost surely, 2115100230043300 is an apocalyptic number.
115100230043300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
115100230043300 is an abundant number, since it is smaller than the sum of its proper divisors (134668004766556).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115100230043300 is a wasteful number, since it uses less digits than its factorization.
115100230043300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3389948 (or 3389941 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 115100230043300 its reverse (3340032001511), we get a palindrome (118440262044811).
The spelling of 115100230043300 in words is "one hundred fifteen trillion, one hundred billion, two hundred thirty million, forty-three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •