Base | Representation |
---|---|
bin | 11001111011111101100100… |
… | …001011011101011100011010 |
3 | 112221220011001002200200111212 |
4 | 121323331210023131130122 |
5 | 104422422334041442000 |
6 | 1042335453505023122 |
7 | 33012260330253302 |
oct | 3173754413353432 |
9 | 487804032620455 |
10 | 114071717140250 |
11 | 3338a5a8533801 |
12 | 10963a43324aa2 |
13 | 4b85bbc1b264c |
14 | 2025159d60602 |
15 | d2c40191ac35 |
hex | 67bf642dd71a |
114071717140250 has 64 divisors (see below), whose sum is σ = 226211920197120. Its totient is φ = 42924065900800.
The previous prime is 114071717140237. The next prime is 114071717140259. The reversal of 114071717140250 is 52041717170411.
114071717140250 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 114071717140198 and 114071717140207.
It is not an unprimeable number, because it can be changed into a prime (114071717140259) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2439371 + ... + 15300129.
It is an arithmetic number, because the mean of its divisors is an integer number (3534561253080).
Almost surely, 2114071717140250 is an apocalyptic number.
114071717140250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
114071717140250 is a deficient number, since it is larger than the sum of its proper divisors (112140203056870).
114071717140250 is a wasteful number, since it uses less digits than its factorization.
114071717140250 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12862880 (or 12862870 counting only the distinct ones).
The product of its (nonzero) digits is 54880, while the sum is 41.
The spelling of 114071717140250 in words is "one hundred fourteen trillion, seventy-one billion, seven hundred seventeen million, one hundred forty thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •