Base | Representation |
---|---|
bin | 110100110100101001… |
… | …0000101111000001000 |
3 | 101211210111220110110022 |
4 | 1221221102011320020 |
5 | 3324303442000130 |
6 | 124040032240012 |
7 | 11124015561362 |
oct | 1515122057010 |
9 | 354714813408 |
10 | 113435500040 |
11 | 44120423145 |
12 | 19b993a0008 |
13 | a90a1a2275 |
14 | 56c1591d32 |
15 | 2e3da137e5 |
hex | 1a69485e08 |
113435500040 has 48 divisors (see below), whose sum is σ = 255801653100. Its totient is φ = 45272777088.
The previous prime is 113435499967. The next prime is 113435500093. The reversal of 113435500040 is 40005534311.
It can be written as a sum of positive squares in 2 ways, for example, as 103247827684 + 10187672356 = 321322^2 + 100934^2 .
It is a super-2 number, since 2×1134355000402 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113435499982 and 113435500009.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8568146 + ... + 8581374.
Almost surely, 2113435500040 is an apocalyptic number.
113435500040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113435500040 is an abundant number, since it is smaller than the sum of its proper divisors (142366153060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113435500040 is an equidigital number, since it uses as much as digits as its factorization.
113435500040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14166 (or 13699 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 26.
The spelling of 113435500040 in words is "one hundred thirteen billion, four hundred thirty-five million, five hundred thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •