Base | Representation |
---|---|
bin | 11001111010111100101110… |
… | …101011101001010100101001 |
3 | 112221122111100101000012100001 |
4 | 121322330232223221110221 |
5 | 104420302300113143423 |
6 | 1042243501454543001 |
7 | 33004244213404135 |
oct | 3172745653512451 |
9 | 487574311005301 |
10 | 114002100131113 |
11 | 3336302354a407 |
12 | 10952454807a61 |
13 | 4b7c47620260c |
14 | 2021a341623c5 |
15 | d2a6c9c5dcad |
hex | 67af2eae9529 |
114002100131113 has 4 divisors (see below), whose sum is σ = 114046099400448. Its totient is φ = 113958100861780.
The previous prime is 114002100131077. The next prime is 114002100131131. The reversal of 114002100131113 is 311131001200411.
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 114002100131113 - 233 = 113993510196521 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114002100231113) 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, 21999630781 + ... + 21999635962.
It is an arithmetic number, because the mean of its divisors is an integer number (28511524850112).
Almost surely, 2114002100131113 is an apocalyptic number.
It is an amenable number.
114002100131113 is a deficient number, since it is larger than the sum of its proper divisors (43999269335).
114002100131113 is an equidigital number, since it uses as much as digits as its factorization.
114002100131113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43999269334.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 114002100131113 its reverse (311131001200411), we get a palindrome (425133101331524).
The spelling of 114002100131113 in words is "one hundred fourteen trillion, two billion, one hundred million, one hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.291 sec. • engine limits •