Base | Representation |
---|---|
bin | 110101001111010101… |
… | …1010011100010011001 |
3 | 101221002221111220210012 |
4 | 1222132223103202121 |
5 | 3333122303131131 |
6 | 124304552331305 |
7 | 11155144014125 |
oct | 1523653234231 |
9 | 357087456705 |
10 | 114331302041 |
11 | 44540048480 |
12 | 1a1a93a3b35 |
13 | aa20958c18 |
14 | 5768538585 |
15 | 2e924b152b |
hex | 1a9ead3899 |
114331302041 has 8 divisors (see below), whose sum is σ = 125168921568. Its totient is φ = 103567660000.
The previous prime is 114331302037. The next prime is 114331302077. The reversal of 114331302041 is 140203133411.
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 114331302041 - 22 = 114331302037 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 114331301998 and 114331302016.
It is not an unprimeable number, because it can be changed into a prime (114331302011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18491135 + ... + 18497316.
It is an arithmetic number, because the mean of its divisors is an integer number (15646115196).
Almost surely, 2114331302041 is an apocalyptic number.
114331302041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
114331302041 is a deficient number, since it is larger than the sum of its proper divisors (10837619527).
114331302041 is a wasteful number, since it uses less digits than its factorization.
114331302041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36988743.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 114331302041 its reverse (140203133411), we get a palindrome (254534435452).
The spelling of 114331302041 in words is "one hundred fourteen billion, three hundred thirty-one million, three hundred two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •