Base | Representation |
---|---|
bin | 110101000111010111… |
… | …0000001100010011001 |
3 | 101220102021202012012201 |
4 | 1222032232001202121 |
5 | 3332100234014124 |
6 | 124222230210201 |
7 | 11145413266252 |
oct | 1521656014231 |
9 | 356367665181 |
10 | 114063579289 |
11 | 44412a0a400 |
12 | 1a1337b3961 |
13 | a9aa34c7aa |
14 | 5740b67b29 |
15 | 2e78c2b144 |
hex | 1a8eb81899 |
114063579289 has 9 divisors (see below), whose sum is σ = 125379753429. Its totient is φ = 103690785660.
The previous prime is 114063579271. The next prime is 114063579293. The reversal of 114063579289 is 982975360411.
It is a happy number.
The square root of 114063579289 is 337733.
It is a perfect power (a square), and thus also a powerful number.
It is a de Polignac number, because none of the positive numbers 2k-114063579289 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114063579229) 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 8 ways as a sum of consecutive naturals, for example, 3699712 + ... + 3730414.
It is a 1-persistent number, because it is pandigital, but 2⋅114063579289 = 228127158578 is not.
Almost surely, 2114063579289 is an apocalyptic number.
114063579289 is the 337733-rd square number.
114063579289 is the 168867-th centered octagonal number.
It is an amenable number.
114063579289 is a deficient number, since it is larger than the sum of its proper divisors (11316174140).
114063579289 is an frugal number, since it uses more digits than its factorization.
114063579289 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61428 (or 30714 counting only the distinct ones).
The product of its (nonzero) digits is 3265920, while the sum is 55.
The spelling of 114063579289 in words is "one hundred fourteen billion, sixty-three million, five hundred seventy-nine thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •