Base | Representation |
---|---|
bin | 10110111111011001001110… |
… | …000110100011101000101001 |
3 | 111021000100102211002112100110 |
4 | 112333121032012203220221 |
5 | 101223120301142032410 |
6 | 555014511344524533 |
7 | 30204130031452221 |
oct | 2677311606435051 |
9 | 437010384075313 |
10 | 101113430424105 |
11 | 2a243a684a8620 |
12 | b410563320749 |
13 | 4455c56527518 |
14 | 1ad7cb7c89081 |
15 | ba52d4395720 |
hex | 5bf64e1a3a29 |
101113430424105 has 16 divisors (see below), whose sum is σ = 176488896740544. Its totient is φ = 49024693538880.
The previous prime is 101113430424103. The next prime is 101113430424121. The reversal of 101113430424105 is 501424034311101.
It is a happy number.
It is not a de Polignac number, because 101113430424105 - 21 = 101113430424103 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (101113430424103) 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, 306404334454 + ... + 306404334783.
It is an arithmetic number, because the mean of its divisors is an integer number (11030556046284).
Almost surely, 2101113430424105 is an apocalyptic number.
101113430424105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
101113430424105 is a deficient number, since it is larger than the sum of its proper divisors (75375466316439).
101113430424105 is a wasteful number, since it uses less digits than its factorization.
101113430424105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 612808669256.
The product of its (nonzero) digits is 5760, while the sum is 30.
Adding to 101113430424105 its reverse (501424034311101), we get a palindrome (602537464735206).
The spelling of 101113430424105 in words is "one hundred one trillion, one hundred thirteen billion, four hundred thirty million, four hundred twenty-four thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •