Base | Representation |
---|---|
bin | 11010000010101000011111… |
… | …111110101100100001100111 |
3 | 120000111222021222201120100021 |
4 | 122002220133332230201213 |
5 | 110002430203404203020 |
6 | 1043330230054500011 |
7 | 33060346333121524 |
oct | 3202503776544147 |
9 | 500458258646307 |
10 | 114530134444135 |
11 | 33546a59110143 |
12 | 10a1885a364607 |
13 | 4bba1b73c3297 |
14 | 203d40670814b |
15 | d392d1b351aa |
hex | 682a1ffac867 |
114530134444135 has 4 divisors (see below), whose sum is σ = 137436161332968. Its totient is φ = 91624107555304.
The previous prime is 114530134444091. The next prime is 114530134444199. The reversal of 114530134444135 is 531444431035411.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 114530134444135 - 27 = 114530134444007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 114530134444091 and 114530134444100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11453013444409 + ... + 11453013444418.
It is an arithmetic number, because the mean of its divisors is an integer number (34359040333242).
Almost surely, 2114530134444135 is an apocalyptic number.
114530134444135 is a deficient number, since it is larger than the sum of its proper divisors (22906026888833).
114530134444135 is an equidigital number, since it uses as much as digits as its factorization.
114530134444135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22906026888832.
The product of its (nonzero) digits is 691200, while the sum is 43.
Adding to 114530134444135 its reverse (531444431035411), we get a palindrome (645974565479546).
The spelling of 114530134444135 in words is "one hundred fourteen trillion, five hundred thirty billion, one hundred thirty-four million, four hundred forty-four thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •