Base | Representation |
---|---|
bin | 11010001110011101000111… |
… | …111111101011100101010000 |
3 | 120010101122021221121002220001 |
4 | 122032131013333223211100 |
5 | 110104233022440010000 |
6 | 1045151345454255344 |
7 | 33203140012441624 |
oct | 3216350777534520 |
9 | 503348257532801 |
10 | 115342554610000 |
11 | 3382a559115323 |
12 | 10b2a1b01b7554 |
13 | 4c489aa586813 |
14 | 206a8763c1184 |
15 | d504d04e146a |
hex | 68e747feb950 |
115342554610000 has 100 divisors (see below), whose sum is σ = 279265696646112. Its totient is φ = 46135396528000.
The previous prime is 115342554609991. The next prime is 115342554610001. The reversal of 115342554610000 is 16455243511.
115342554610000 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (100).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115342554610001) 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, 306882189 + ... + 307257811.
Almost surely, 2115342554610000 is an apocalyptic number.
115342554610000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
115342554610000 is an abundant number, since it is smaller than the sum of its proper divisors (163923142036112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115342554610000 is an equidigital number, since it uses as much as digits as its factorization.
115342554610000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 406358 (or 406337 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 37.
The spelling of 115342554610000 in words is "one hundred fifteen trillion, three hundred forty-two billion, five hundred fifty-four million, six hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •