Base | Representation |
---|---|
bin | 1100110101100110100110… |
… | …0101101100110010101111 |
3 | 1211222101100222201220101222 |
4 | 3031121221211230302233 |
5 | 3322230042202301020 |
6 | 50004205045253555 |
7 | 2654530462420121 |
oct | 315315145546257 |
9 | 54871328656358 |
10 | 14115034025135 |
11 | 455217480234a |
12 | 16bb7084042bb |
13 | 7b5071363844 |
14 | 36b25804d211 |
15 | 19726ee1db25 |
hex | cd66996ccaf |
14115034025135 has 8 divisors (see below), whose sum is σ = 16938061014336. Its totient is φ = 11292013764000.
The previous prime is 14115034025123. The next prime is 14115034025233. The reversal of 14115034025135 is 53152043051141.
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 14115034025135 - 28 = 14115034024879 is a prime.
It is a super-3 number, since 3×141150340251353 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14115034025095 and 14115034025104.
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, 7137242 + ... + 8897768.
It is an arithmetic number, because the mean of its divisors is an integer number (2117257626792).
Almost surely, 214115034025135 is an apocalyptic number.
14115034025135 is a deficient number, since it is larger than the sum of its proper divisors (2823026989201).
14115034025135 is a wasteful number, since it uses less digits than its factorization.
14115034025135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3364033.
The product of its (nonzero) digits is 36000, while the sum is 35.
Adding to 14115034025135 its reverse (53152043051141), we get a palindrome (67267077076276).
The spelling of 14115034025135 in words is "fourteen trillion, one hundred fifteen billion, thirty-four million, twenty-five thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •