Base | Representation |
---|---|
bin | 11001111100110001100011… |
… | …100000110101010100100110 |
3 | 112222002111010112021020210020 |
4 | 121330301203200311110212 |
5 | 104424331200334300320 |
6 | 1042421245054140010 |
7 | 33016304563321044 |
oct | 3174614340652446 |
9 | 488074115236706 |
10 | 114127540540710 |
11 | 33401244377804 |
12 | 109728224b1606 |
13 | 4b8b247567c58 |
14 | 2027b33c4d394 |
15 | d2dabc662940 |
hex | 67cc63835526 |
114127540540710 has 32 divisors (see below), whose sum is σ = 273949375695840. Its totient is φ = 30429202099968.
The previous prime is 114127540540681. The next prime is 114127540540801. The reversal of 114127540540710 is 17045045721411.
114127540540710 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 300351397 + ... + 300731136.
It is an arithmetic number, because the mean of its divisors is an integer number (8560917990495).
Almost surely, 2114127540540710 is an apocalyptic number.
114127540540710 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
114127540540710 is an abundant number, since it is smaller than the sum of its proper divisors (159821835155130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114127540540710 is a wasteful number, since it uses less digits than its factorization.
114127540540710 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 601088872.
The product of its (nonzero) digits is 156800, while the sum is 42.
The spelling of 114127540540710 in words is "one hundred fourteen trillion, one hundred twenty-seven billion, five hundred forty million, five hundred forty thousand, seven hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •