Base | Representation |
---|---|
bin | 110101001001011110… |
… | …0001100110010000111 |
3 | 101220121020000110202201 |
4 | 1222102330030302013 |
5 | 3332221401413411 |
6 | 124233240215331 |
7 | 11150233300051 |
oct | 1522274146207 |
9 | 356536013681 |
10 | 114134404231 |
11 | 44449994211 |
12 | 1a15346a547 |
13 | a9bbc19943 |
14 | 574a3228d1 |
15 | 2e8006b3c1 |
hex | 1a92f0cc87 |
114134404231 has 4 divisors (see below), whose sum is σ = 114233566464. Its totient is φ = 114035242000.
The previous prime is 114134404229. The next prime is 114134404243. The reversal of 114134404231 is 132404431411.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 114134404231 - 21 = 114134404229 is a prime.
It is a super-2 number, since 2×1141344042312 (a number of 23 digits) contains 22 as substring.
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 114134404231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114134404201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 49579390 + ... + 49581691.
It is an arithmetic number, because the mean of its divisors is an integer number (28558391616).
Almost surely, 2114134404231 is an apocalyptic number.
114134404231 is a deficient number, since it is larger than the sum of its proper divisors (99162233).
114134404231 is an equidigital number, since it uses as much as digits as its factorization.
114134404231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99162232.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 114134404231 its reverse (132404431411), we get a palindrome (246538835642).
The spelling of 114134404231 in words is "one hundred fourteen billion, one hundred thirty-four million, four hundred four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •