Base | Representation |
---|---|
bin | 11010001111110110110000… |
… | …111111010111001011011101 |
3 | 120010201211201211110120221122 |
4 | 122033312300333113023131 |
5 | 110112322133141231441 |
6 | 1045303504411140325 |
7 | 33213115132666433 |
oct | 3217666077271335 |
9 | 503654654416848 |
10 | 115438805414621 |
11 | 3386736019a447 |
12 | 10b449924446a5 |
13 | 4c54aa9409550 |
14 | 20713a7536d53 |
15 | d52c654e834b |
hex | 68fdb0fd72dd |
115438805414621 has 8 divisors (see below), whose sum is σ = 124791408255360. Its totient is φ = 106153730392752.
The previous prime is 115438805414609. The next prime is 115438805414623. The reversal of 115438805414621 is 126414508834511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 115438805414621 - 214 = 115438805398237 is a prime.
It is a super-2 number, since 2×1154388054146212 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115438805414623) 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, 16881951161 + ... + 16881957998.
It is an arithmetic number, because the mean of its divisors is an integer number (15598926031920).
Almost surely, 2115438805414621 is an apocalyptic number.
It is an amenable number.
115438805414621 is a deficient number, since it is larger than the sum of its proper divisors (9352602840739).
115438805414621 is a wasteful number, since it uses less digits than its factorization.
115438805414621 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33763909435.
The product of its (nonzero) digits is 3686400, while the sum is 53.
The spelling of 115438805414621 in words is "one hundred fifteen trillion, four hundred thirty-eight billion, eight hundred five million, four hundred fourteen thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •