Base | Representation |
---|---|
bin | 11001111110010001000101… |
… | …101110011101110011010011 |
3 | 112222110021220110122100211002 |
4 | 121332101011232131303103 |
5 | 104433021241210404021 |
6 | 1042540332004212215 |
7 | 33026565601413002 |
oct | 3176210556356323 |
9 | 488407813570732 |
10 | 114230120013011 |
11 | 334407a38575a2 |
12 | 1098a69009a06b |
13 | 4b97b145b0c62 |
14 | 202caa56cac39 |
15 | d315c307550b |
hex | 67e445b9dcd3 |
114230120013011 has 8 divisors (see below), whose sum is σ = 114894413572848. Its totient is φ = 113566191156000.
The previous prime is 114230120012999. The next prime is 114230120013013. The reversal of 114230120013011 is 110310021032411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114230120013011 is a prime.
It is a super-2 number, since 2×1142301200130112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114230120013013) 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, 90547445 + ... + 91800326.
It is an arithmetic number, because the mean of its divisors is an integer number (14361801696606).
Almost surely, 2114230120013011 is an apocalyptic number.
114230120013011 is a deficient number, since it is larger than the sum of its proper divisors (664293559837).
114230120013011 is a wasteful number, since it uses less digits than its factorization.
114230120013011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182351413.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 114230120013011 its reverse (110310021032411), we get a palindrome (224540141045422).
The spelling of 114230120013011 in words is "one hundred fourteen trillion, two hundred thirty billion, one hundred twenty million, thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •