Base | Representation |
---|---|
bin | 110100100111101010… |
… | …1111110010011111010 |
3 | 101210200012000111222001 |
4 | 1221033111332103322 |
5 | 3322411034410020 |
6 | 123524524451214 |
7 | 11110152533650 |
oct | 1511725762372 |
9 | 353605014861 |
10 | 113000310010 |
11 | 43a17802465 |
12 | 19a976a9b0a |
13 | a86ac8c583 |
14 | 567d86add0 |
15 | 2e156ed50a |
hex | 1a4f57e4fa |
113000310010 has 32 divisors (see below), whose sum is σ = 232610631552. Its totient is φ = 38717488320.
The previous prime is 113000309971. The next prime is 113000310061. The reversal of 113000310010 is 10013000311.
It is a super-2 number, since 2×1130003100102 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 423361 + ... + 636580.
It is an arithmetic number, because the mean of its divisors is an integer number (7269082236).
Almost surely, 2113000310010 is an apocalyptic number.
113000310010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
113000310010 is an abundant number, since it is smaller than the sum of its proper divisors (119610321542).
113000310010 is a wasteful number, since it uses less digits than its factorization.
113000310010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1061478.
The product of its (nonzero) digits is 9, while the sum is 10.
Adding to 113000310010 its reverse (10013000311), we get a palindrome (123013310321).
The spelling of 113000310010 in words is "one hundred thirteen billion, three hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •