Base | Representation |
---|---|
bin | 11010000010010001011101… |
… | …111111110010101111000111 |
3 | 120000102121110120010111121121 |
4 | 122002101131333302233013 |
5 | 110002024032202142320 |
6 | 1043311020143254411 |
7 | 33055512453235153 |
oct | 3202213577625707 |
9 | 500377416114547 |
10 | 114505405115335 |
11 | 33537519046423 |
12 | 10a13ab85aa407 |
13 | 4bb7a75c89250 |
14 | 203c13c29c063 |
15 | d38835acb8aa |
hex | 68245dff2bc7 |
114505405115335 has 8 divisors (see below), whose sum is σ = 147976215841440. Its totient is φ = 84557837623584.
The previous prime is 114505405115291. The next prime is 114505405115359. The reversal of 114505405115335 is 533511504505411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114505405115335 - 219 = 114505404591047 is a prime.
It is a super-4 number, since 4×1145054051153354 (a number of 57 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 114505405115291 and 114505405115300.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 880810808515 + ... + 880810808644.
It is an arithmetic number, because the mean of its divisors is an integer number (18497026980180).
Almost surely, 2114505405115335 is an apocalyptic number.
114505405115335 is a deficient number, since it is larger than the sum of its proper divisors (33470810726105).
114505405115335 is a wasteful number, since it uses less digits than its factorization.
114505405115335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1761621617177.
The product of its (nonzero) digits is 450000, while the sum is 43.
The spelling of 114505405115335 in words is "one hundred fourteen trillion, five hundred five billion, four hundred five million, one hundred fifteen thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •