Base | Representation |
---|---|
bin | 110101001100110010… |
… | …0011000111101011001 |
3 | 101220212222020222000121 |
4 | 1222121210120331121 |
5 | 3332433333300121 |
6 | 124252251433241 |
7 | 11153053414144 |
oct | 1523144307531 |
9 | 356788228017 |
10 | 114245603161 |
11 | 444a6734658 |
12 | 1a184755821 |
13 | aa08c81921 |
14 | 575adcb05b |
15 | 2e89bd4141 |
hex | 1a99918f59 |
114245603161 has 4 divisors (see below), whose sum is σ = 114290602000. Its totient is φ = 114200604324.
The previous prime is 114245603137. The next prime is 114245603167. The reversal of 114245603161 is 161306542411.
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, and also an emirpimes, since its reverse is a distinct semiprime: 161306542411 = 7 ⋅23043791773.
It is a cyclic number.
It is not a de Polignac number, because 114245603161 - 225 = 114212048729 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114245603167) 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, 22495611 + ... + 22500688.
It is an arithmetic number, because the mean of its divisors is an integer number (28572650500).
Almost surely, 2114245603161 is an apocalyptic number.
It is an amenable number.
114245603161 is a deficient number, since it is larger than the sum of its proper divisors (44998839).
114245603161 is an equidigital number, since it uses as much as digits as its factorization.
114245603161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44998838.
The product of its (nonzero) digits is 17280, while the sum is 34.
The spelling of 114245603161 in words is "one hundred fourteen billion, two hundred forty-five million, six hundred three thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •