Base | Representation |
---|---|
bin | 110100101011100001… |
… | …0110010111101001010 |
3 | 101211000012010001222122 |
4 | 1221113002302331022 |
5 | 3323142123003430 |
6 | 123545421451242 |
7 | 11113311613406 |
oct | 1512702627512 |
9 | 354005101878 |
10 | 113129500490 |
11 | 43a83721156 |
12 | 19b12a10b22 |
13 | a88b983746 |
14 | 5692a9a106 |
15 | 2e21c1bee5 |
hex | 1a570b2f4a |
113129500490 has 32 divisors (see below), whose sum is σ = 207451552896. Its totient is φ = 44410478400.
The previous prime is 113129500489. The next prime is 113129500501. The reversal of 113129500490 is 94005921311.
It is a happy number.
It is a super-2 number, since 2×1131295004902 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 113129500490.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 325997 + ... + 576656.
It is an arithmetic number, because the mean of its divisors is an integer number (6482861028).
Almost surely, 2113129500490 is an apocalyptic number.
113129500490 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
113129500490 is a deficient number, since it is larger than the sum of its proper divisors (94322052406).
113129500490 is a wasteful number, since it uses less digits than its factorization.
113129500490 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 902894.
The product of its (nonzero) digits is 9720, while the sum is 35.
The spelling of 113129500490 in words is "one hundred thirteen billion, one hundred twenty-nine million, five hundred thousand, four hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •