Base | Representation |
---|---|
bin | 110101001011001000… |
… | …1010010100000000001 |
3 | 101220202010010110101221 |
4 | 1222112101102200001 |
5 | 3332330201424241 |
6 | 124242553355041 |
7 | 11151512142340 |
oct | 1522621224001 |
9 | 356663113357 |
10 | 114190264321 |
11 | 44478477781 |
12 | 1a16a108a81 |
13 | a9ca677453 |
14 | 5753903b57 |
15 | 2e84e025d1 |
hex | 1a96452801 |
114190264321 has 4 divisors (see below), whose sum is σ = 130503159232. Its totient is φ = 97877369412.
The previous prime is 114190264291. The next prime is 114190264333. The reversal of 114190264321 is 123462091411.
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 114190264321 - 25 = 114190264289 is a prime.
It is the 337921-st Hogben number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114190264621) by changing a digit.
It is a nontrivial repunit in base 337920.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8156447445 + ... + 8156447458.
It is an arithmetic number, because the mean of its divisors is an integer number (32625789808).
Almost surely, 2114190264321 is an apocalyptic number.
It is an amenable number.
114190264321 is a deficient number, since it is larger than the sum of its proper divisors (16312894911).
114190264321 is an equidigital number, since it uses as much as digits as its factorization.
114190264321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16312894910.
The product of its (nonzero) digits is 10368, while the sum is 34.
The spelling of 114190264321 in words is "one hundred fourteen billion, one hundred ninety million, two hundred sixty-four thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •