Base | Representation |
---|---|
bin | 11001111110011100001010… |
… | …101011111111101010001101 |
3 | 112222111102121102001101222221 |
4 | 121332130022223333222031 |
5 | 104433220121142131110 |
6 | 1042550020142335341 |
7 | 33030466421214226 |
oct | 3176341253775215 |
9 | 488442542041887 |
10 | 114242014411405 |
11 | 33445847941111 |
12 | 10990a4b58a551 |
13 | 4b98c8b8c040a |
14 | 202d4b329a24d |
15 | d31a6c3d67da |
hex | 67e70aaffa8d |
114242014411405 has 8 divisors (see below), whose sum is σ = 137122099875072. Its totient is φ = 91372489808208.
The previous prime is 114242014411373. The next prime is 114242014411411. The reversal of 114242014411405 is 504114410242411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 114242014411405 - 25 = 114242014411373 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2640191317 + ... + 2640234586.
It is an arithmetic number, because the mean of its divisors is an integer number (17140262484384).
Almost surely, 2114242014411405 is an apocalyptic number.
It is an amenable number.
114242014411405 is a deficient number, since it is larger than the sum of its proper divisors (22880085463667).
114242014411405 is an equidigital number, since it uses as much as digits as its factorization.
114242014411405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5280430235.
The product of its (nonzero) digits is 20480, while the sum is 34.
Adding to 114242014411405 its reverse (504114410242411), we get a palindrome (618356424653816).
The spelling of 114242014411405 in words is "one hundred fourteen trillion, two hundred forty-two billion, fourteen million, four hundred eleven thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •