Base | Representation |
---|---|
bin | 11001111110011011001111… |
… | …000100001110010101110001 |
3 | 112222111100000200211211220201 |
4 | 121332123033010032111301 |
5 | 104433211044104130113 |
6 | 1042545333011035201 |
7 | 33030432554032060 |
oct | 3176331704162561 |
9 | 488440020754821 |
10 | 114241014130033 |
11 | 3344538424599a |
12 | 1099081059bb01 |
13 | 4b98b5c5b514b |
14 | 202d41a4b81d7 |
15 | d31a0e69bcdd |
hex | 67e6cf10e571 |
114241014130033 has 8 divisors (see below), whose sum is σ = 130566140754560. Its totient is φ = 97917132942720.
The previous prime is 114241014130003. The next prime is 114241014130091. The reversal of 114241014130033 is 330031410142411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114241014130033 - 221 = 114241012032881 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 114241014129983 and 114241014130010.
It is not an unprimeable number, because it can be changed into a prime (114241014130003) 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, 311162733 + ... + 311529658.
It is an arithmetic number, because the mean of its divisors is an integer number (16320767594320).
Almost surely, 2114241014130033 is an apocalyptic number.
It is an amenable number.
114241014130033 is a deficient number, since it is larger than the sum of its proper divisors (16325126624527).
114241014130033 is an equidigital number, since it uses as much as digits as its factorization.
114241014130033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 622718607.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 114241014130033 its reverse (330031410142411), we get a palindrome (444272424272444).
The spelling of 114241014130033 in words is "one hundred fourteen trillion, two hundred forty-one billion, fourteen million, one hundred thirty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •