Base | Representation |
---|---|
bin | 1101011110111… |
… | …00100011001010 |
3 | 21212211010102000 |
4 | 12233130203022 |
5 | 212423213002 |
6 | 15120051430 |
7 | 2542225350 |
oct | 657344312 |
9 | 255733360 |
10 | 113101002 |
11 | 5892a503 |
12 | 31a63b76 |
13 | 1a57c991 |
14 | 110417d0 |
15 | 9de161c |
hex | 6bdc8ca |
113101002 has 48 divisors (see below), whose sum is σ = 287766720. Its totient is φ = 32255496.
The previous prime is 113100991. The next prime is 113101007. The reversal of 113101002 is 200101311.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (113101007) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 206493 + ... + 207039.
It is an arithmetic number, because the mean of its divisors is an integer number (5995140).
Almost surely, 2113101002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 113101002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (143883360).
113101002 is an abundant number, since it is smaller than the sum of its proper divisors (174665718).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113101002 is an frugal number, since it uses more digits than its factorization.
113101002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1112 (or 559 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 113101002 is about 10634.8954860873. The cubic root of 113101002 is about 483.6028120199.
Adding to 113101002 its reverse (200101311), we get a palindrome (313202313).
It can be divided in two parts, 11 and 3101002, that added together give a palindrome (3101013).
The spelling of 113101002 in words is "one hundred thirteen million, one hundred one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •