Base | Representation |
---|---|
bin | 110101001100010101… |
… | …0100011110110110001 |
3 | 101220211220201202210111 |
4 | 1222120222203312301 |
5 | 3332420443142231 |
6 | 124250550501321 |
7 | 11152510514542 |
oct | 1523052436661 |
9 | 356756652714 |
10 | 114230443441 |
11 | 4449911a964 |
12 | 1a17b664841 |
13 | aa05aa468a |
14 | 5758da24c9 |
15 | 2e886dc4b1 |
hex | 1a98aa3db1 |
114230443441 has 4 divisors (see below), whose sum is σ = 114278623984. Its totient is φ = 114182262900.
The previous prime is 114230443427. The next prime is 114230443447. The reversal of 114230443441 is 144344032411.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 114230443441 - 215 = 114230410673 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114230443447) 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, 24086715 + ... + 24091456.
It is an arithmetic number, because the mean of its divisors is an integer number (28569655996).
Almost surely, 2114230443441 is an apocalyptic number.
It is an amenable number.
114230443441 is a deficient number, since it is larger than the sum of its proper divisors (48180543).
114230443441 is an equidigital number, since it uses as much as digits as its factorization.
114230443441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48180542.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 114230443441 its reverse (144344032411), we get a palindrome (258574475852).
The spelling of 114230443441 in words is "one hundred fourteen billion, two hundred thirty million, four hundred forty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •