Base | Representation |
---|---|
bin | 110101011001011110… |
… | …0001000011010110011 |
3 | 101221222122012102200111 |
4 | 1222302330020122303 |
5 | 3334321320213032 |
6 | 124402415002151 |
7 | 11166442414210 |
oct | 1526274103263 |
9 | 357878172614 |
10 | 114671257267 |
11 | 446a4a31906 |
12 | 1a283209357 |
13 | aa76206068 |
14 | 579b74cb07 |
15 | 2eb2263c47 |
hex | 1ab2f086b3 |
114671257267 has 4 divisors (see below), whose sum is σ = 131052865456. Its totient is φ = 98289649080.
The previous prime is 114671257249. The next prime is 114671257273. The reversal of 114671257267 is 762752176411.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 762752176411 = 17 ⋅44867775083.
It is a de Polignac number, because none of the positive numbers 2k-114671257267 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 114671257267.
It is not an unprimeable number, because it can be changed into a prime (114671257567) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8190804084 + ... + 8190804097.
It is an arithmetic number, because the mean of its divisors is an integer number (32763216364).
Almost surely, 2114671257267 is an apocalyptic number.
114671257267 is a deficient number, since it is larger than the sum of its proper divisors (16381608189).
114671257267 is an equidigital number, since it uses as much as digits as its factorization.
114671257267 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16381608188.
The product of its digits is 987840, while the sum is 49.
The spelling of 114671257267 in words is "one hundred fourteen billion, six hundred seventy-one million, two hundred fifty-seven thousand, two hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •