Base | Representation |
---|---|
bin | 11001111010111110100111… |
… | …010000101100110000001011 |
3 | 112221122200120100121012020020 |
4 | 121322332213100230300023 |
5 | 104420320421004013121 |
6 | 1042244434322231523 |
7 | 33004345306424022 |
oct | 3172764720546013 |
9 | 487580510535206 |
10 | 114004123110411 |
11 | 33363971461726 |
12 | 1095291a1b55a3 |
13 | 4b7c7093641a1 |
14 | 2021b86abd8b9 |
15 | d2a7976601c6 |
hex | 67afa742cc0b |
114004123110411 has 8 divisors (see below), whose sum is σ = 152129786526720. Its totient is φ = 75940604217192.
The previous prime is 114004123110359. The next prime is 114004123110491. The reversal of 114004123110411 is 114011321400411.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114004123110411 - 211 = 114004123108363 is a prime.
It is a super-2 number, since 2×1140041231104112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (114004123110491) 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, 15536126491 + ... + 15536133828.
It is an arithmetic number, because the mean of its divisors is an integer number (19016223315840).
Almost surely, 2114004123110411 is an apocalyptic number.
114004123110411 is a deficient number, since it is larger than the sum of its proper divisors (38125663416309).
114004123110411 is a wasteful number, since it uses less digits than its factorization.
114004123110411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31072261545.
The product of its (nonzero) digits is 384, while the sum is 24.
Adding to 114004123110411 its reverse (114011321400411), we get a palindrome (228015444510822).
The spelling of 114004123110411 in words is "one hundred fourteen trillion, four billion, one hundred twenty-three million, one hundred ten thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •