Base | Representation |
---|---|
bin | 110100101010101011… |
… | …1010000110000110110 |
3 | 101210221020001220022120 |
4 | 1221111113100300312 |
5 | 3323112413423110 |
6 | 123542533340410 |
7 | 11112520165401 |
oct | 1512527206066 |
9 | 353836056276 |
10 | 113101311030 |
11 | 43a69817a84 |
12 | 19b05497706 |
13 | a885b938a6 |
14 | 568d03cd38 |
15 | 2e1e4ee870 |
hex | 1a555d0c36 |
113101311030 has 64 divisors (see below), whose sum is σ = 278933416128. Its totient is φ = 29328998400.
The previous prime is 113101311013. The next prime is 113101311079. The reversal of 113101311030 is 30113101311.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2051830 + ... + 2106230.
It is an arithmetic number, because the mean of its divisors is an integer number (4358334627).
Almost surely, 2113101311030 is an apocalyptic number.
113101311030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 113101311030, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (139466708064).
113101311030 is an abundant number, since it is smaller than the sum of its proper divisors (165832105098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113101311030 is a wasteful number, since it uses less digits than its factorization.
113101311030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56321.
The product of its (nonzero) digits is 27, while the sum is 15.
Adding to 113101311030 its reverse (30113101311), we get a palindrome (143214412341).
The spelling of 113101311030 in words is "one hundred thirteen billion, one hundred one million, three hundred eleven thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •