Base | Representation |
---|---|
bin | 11001111011000101011010… |
… | …110010110100010001000001 |
3 | 112221200101102121001220121101 |
4 | 121323011122302310101001 |
5 | 104420430402104034131 |
6 | 1042252043345254401 |
7 | 33005024344243114 |
oct | 3173053262642101 |
9 | 487611377056541 |
10 | 114011430143041 |
11 | 33366a81053472 |
12 | 10954219334401 |
13 | 4b8030215ac32 |
14 | 202227b32057b |
15 | d2aa73dc6c61 |
hex | 67b15acb4441 |
114011430143041 has 4 divisors (see below), whose sum is σ = 114025424434992. Its totient is φ = 113997435851092.
The previous prime is 114011430142963. The next prime is 114011430143047. The reversal of 114011430143041 is 140341034110411.
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 114011430143041 - 243 = 105215337120833 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114011430143047) 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, 6997133755 + ... + 6997150048.
It is an arithmetic number, because the mean of its divisors is an integer number (28506356108748).
Almost surely, 2114011430143041 is an apocalyptic number.
It is an amenable number.
114011430143041 is a deficient number, since it is larger than the sum of its proper divisors (13994291951).
114011430143041 is an equidigital number, since it uses as much as digits as its factorization.
114011430143041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13994291950.
The product of its (nonzero) digits is 2304, while the sum is 28.
Adding to 114011430143041 its reverse (140341034110411), we get a palindrome (254352464253452).
The spelling of 114011430143041 in words is "one hundred fourteen trillion, eleven billion, four hundred thirty million, one hundred forty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •