Base | Representation |
---|---|
bin | 110101001100010101… |
… | …1011001000011000011 |
3 | 101220211221010211122220 |
4 | 1222120223121003003 |
5 | 3332421022130230 |
6 | 124250555302123 |
7 | 11152512413001 |
oct | 1523053310303 |
9 | 356757124586 |
10 | 114230661315 |
11 | 44499259621 |
12 | 1a17b74a943 |
13 | aa05b4c8b4 |
14 | 575901ba71 |
15 | 2e88731d10 |
hex | 1a98ad90c3 |
114230661315 has 8 divisors (see below), whose sum is σ = 182769058128. Its totient is φ = 60923019360.
The previous prime is 114230661257. The next prime is 114230661319. The reversal of 114230661315 is 513166032411.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114230661315 - 27 = 114230661187 is a prime.
It is not an unprimeable number, because it can be changed into a prime (114230661319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3807688696 + ... + 3807688725.
It is an arithmetic number, because the mean of its divisors is an integer number (22846132266).
Almost surely, 2114230661315 is an apocalyptic number.
114230661315 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
114230661315 is a deficient number, since it is larger than the sum of its proper divisors (68538396813).
114230661315 is an equidigital number, since it uses as much as digits as its factorization.
114230661315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7615377429.
The product of its (nonzero) digits is 12960, while the sum is 33.
Adding to 114230661315 its reverse (513166032411), we get a palindrome (627396693726).
The spelling of 114230661315 in words is "one hundred fourteen billion, two hundred thirty million, six hundred sixty-one thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •