Base | Representation |
---|---|
bin | 110101000110101100… |
… | …0010100000111110111 |
3 | 101220100201110200120000 |
4 | 1222031120110013313 |
5 | 3332024011023111 |
6 | 124220104442343 |
7 | 11145021310161 |
oct | 1521530240767 |
9 | 356321420500 |
10 | 114041111031 |
11 | 444012636a1 |
12 | 1a1281793b3 |
13 | a9a57b3a73 |
14 | 573bb99931 |
15 | 2e76c8dc56 |
hex | 1a8d6141f7 |
114041111031 has 10 divisors (see below), whose sum is σ = 170357709192. Its totient is φ = 76027407300.
The previous prime is 114041111017. The next prime is 114041111057. The reversal of 114041111031 is 130111140411.
114041111031 is a `hidden beast` number, since 1 + 140 + 411 + 110 + 3 + 1 = 666.
It is not a de Polignac number, because 114041111031 - 214 = 114041094647 is a prime.
It is a super-2 number, since 2×1140411110312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 114041110995 and 114041111013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114041111131) 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 9 ways as a sum of consecutive naturals, for example, 703957395 + ... + 703957556.
Almost surely, 2114041111031 is an apocalyptic number.
114041111031 is a deficient number, since it is larger than the sum of its proper divisors (56316598161).
114041111031 is an equidigital number, since it uses as much as digits as its factorization.
114041111031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1407914963 (or 1407914954 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 114041111031 its reverse (130111140411), we get a palindrome (244152251442).
The spelling of 114041111031 in words is "one hundred fourteen billion, forty-one million, one hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •