Base | Representation |
---|---|
bin | 11001110100001001101101… |
… | …011010010000001101001010 |
3 | 112212222211200102202221012121 |
4 | 121310021231122100031022 |
5 | 104340124140240214010 |
6 | 1041245132013401454 |
7 | 32625430111224040 |
oct | 3164115532201512 |
9 | 485884612687177 |
10 | 113535001101130 |
11 | 331a2a182a7724 |
12 | 10897a1619928a |
13 | 4b473c646a04b |
14 | 20071a2772390 |
15 | d1d48c7863da |
hex | 67426d69034a |
113535001101130 has 128 divisors (see below), whose sum is σ = 242957749363200. Its totient is φ = 37374724767744.
The previous prime is 113535001101083. The next prime is 113535001101133. The reversal of 113535001101130 is 31101100535311.
It is a junction number, because it is equal to n+sod(n) for n = 113535001101095 and 113535001101104.
It is not an unprimeable number, because it can be changed into a prime (113535001101133) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1031528041 + ... + 1031638099.
It is an arithmetic number, because the mean of its divisors is an integer number (1898107416900).
Almost surely, 2113535001101130 is an apocalyptic number.
113535001101130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
113535001101130 is an abundant number, since it is smaller than the sum of its proper divisors (129422748262070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113535001101130 is a wasteful number, since it uses less digits than its factorization.
113535001101130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112928.
The product of its (nonzero) digits is 675, while the sum is 25.
Adding to 113535001101130 its reverse (31101100535311), we get a palindrome (144636101636441).
The spelling of 113535001101130 in words is "one hundred thirteen trillion, five hundred thirty-five billion, one million, one hundred one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •