Base | Representation |
---|---|
bin | 110101001000111011… |
… | …0000011001000010111 |
3 | 101220112221102011221211 |
4 | 1222101312003020113 |
5 | 3332202144431430 |
6 | 124231342122251 |
7 | 11146621056031 |
oct | 1522166031027 |
9 | 356487364854 |
10 | 114116014615 |
11 | 4443a573889 |
12 | 1a149280387 |
13 | a9b817b505 |
14 | 5747ad6c51 |
15 | 2e7d63772a |
hex | 1a91d83217 |
114116014615 has 8 divisors (see below), whose sum is σ = 140123850768. Its totient is φ = 89169722880.
The previous prime is 114116014609. The next prime is 114116014651. The reversal of 114116014615 is 516410611411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114116014615 - 223 = 114107626007 is a prime.
It is a super-2 number, since 2×1141160146152 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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, 265385866 + ... + 265386295.
It is an arithmetic number, because the mean of its divisors is an integer number (17515481346).
Almost surely, 2114116014615 is an apocalyptic number.
114116014615 is a deficient number, since it is larger than the sum of its proper divisors (26007836153).
114116014615 is an equidigital number, since it uses as much as digits as its factorization.
114116014615 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 530772209.
The product of its (nonzero) digits is 2880, while the sum is 31.
The spelling of 114116014615 in words is "one hundred fourteen billion, one hundred sixteen million, fourteen thousand, six hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •