Base | Representation |
---|---|
bin | 11001110100001111010101… |
… | …000100010101100010000111 |
3 | 112220000102020221220120000022 |
4 | 121310033111010111202013 |
5 | 104340224014444403133 |
6 | 1041252010444205355 |
7 | 32626032460636424 |
oct | 3164172504254207 |
9 | 486012227816008 |
10 | 113541035153543 |
11 | 331a55343765a8 |
12 | 1089901ab3985b |
13 | 4b47b485c946a |
14 | 20075b5cc6d4b |
15 | d1d6e2398998 |
hex | 6743d5115887 |
113541035153543 has 16 divisors (see below), whose sum is σ = 114186980793600. Its totient is φ = 112896761267520.
The previous prime is 113541035153509. The next prime is 113541035153551. The reversal of 113541035153543 is 345351530145311.
It is a cyclic number.
It is not a de Polignac number, because 113541035153543 - 230 = 113539961411719 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113541035153494 and 113541035153503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113541035153563) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1360399148 + ... + 1360482606.
It is an arithmetic number, because the mean of its divisors is an integer number (7136686299600).
Almost surely, 2113541035153543 is an apocalyptic number.
113541035153543 is a deficient number, since it is larger than the sum of its proper divisors (645945640057).
113541035153543 is an equidigital number, since it uses as much as digits as its factorization.
113541035153543 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93382.
The product of its (nonzero) digits is 810000, while the sum is 44.
Adding to 113541035153543 its reverse (345351530145311), we get a palindrome (458892565298854).
The spelling of 113541035153543 in words is "one hundred thirteen trillion, five hundred forty-one billion, thirty-five million, one hundred fifty-three thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •