Base | Representation |
---|---|
bin | 110100110000001011… |
… | …0000010100011111101 |
3 | 101211102001201201002012 |
4 | 1221200112002203331 |
5 | 3324002044240333 |
6 | 124013114141005 |
7 | 11120215126355 |
oct | 1514026024375 |
9 | 354361651065 |
10 | 113285540093 |
11 | 44053809000 |
12 | 19b57121765 |
13 | a8b50b867b |
14 | 56a96b7b65 |
15 | 2e30790e48 |
hex | 1a605828fd |
113285540093 has 32 divisors (see below), whose sum is σ = 132640156800. Its totient is φ = 96468324480.
The previous prime is 113285540047. The next prime is 113285540099. The reversal of 113285540093 is 390045582311.
It is not a de Polignac number, because 113285540093 - 210 = 113285539069 is a prime.
It is a super-2 number, since 2×1132855400932 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 113285540093.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113285540099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2225555 + ... + 2275887.
It is an arithmetic number, because the mean of its divisors is an integer number (4145004900).
Almost surely, 2113285540093 is an apocalyptic number.
It is an amenable number.
113285540093 is a deficient number, since it is larger than the sum of its proper divisors (19354616707).
113285540093 is an equidigital number, since it uses as much as digits as its factorization.
113285540093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50474 (or 50452 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 41.
The spelling of 113285540093 in words is "one hundred thirteen billion, two hundred eighty-five million, five hundred forty thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •