Base | Representation |
---|---|
bin | 11001111011000100011111… |
… | …001011100101000001100010 |
3 | 112221200021211220010102222211 |
4 | 121323010133023211001202 |
5 | 104420421330040020000 |
6 | 1042251400220552334 |
7 | 33004660511211616 |
oct | 3173043713450142 |
9 | 487607756112884 |
10 | 114010430001250 |
11 | 33366608543102 |
12 | 10953b9a3b26aa |
13 | 4b801a2ba1363 |
14 | 20221c4577346 |
15 | d2aa161b87ba |
hex | 67b11f2e5062 |
114010430001250 has 20 divisors (see below), whose sum is σ = 213701149996686. Its totient is φ = 45604172000000.
The previous prime is 114010430001233. The next prime is 114010430001271. The reversal of 114010430001250 is 52100034010411.
It can be written as a sum of positive squares in 5 ways, for example, as 321374476201 + 113689055525049 = 566899^2 + 10662507^2 .
It is a super-3 number, since 3×1140104300012503 (a number of 43 digits) contains 333 as substring.
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 9 ways as a sum of consecutive naturals, for example, 45604170751 + ... + 45604173250.
Almost surely, 2114010430001250 is an apocalyptic number.
114010430001250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
114010430001250 is a deficient number, since it is larger than the sum of its proper divisors (99690719995436).
114010430001250 is an frugal number, since it uses more digits than its factorization.
114010430001250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91208344023 (or 91208344008 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 22.
Adding to 114010430001250 its reverse (52100034010411), we get a palindrome (166110464011661).
The spelling of 114010430001250 in words is "one hundred fourteen trillion, ten billion, four hundred thirty million, one thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •