Base | Representation |
---|---|
bin | 110100101110001110… |
… | …0011111001011111100 |
3 | 101211020111122002102102 |
4 | 1221130130133023330 |
5 | 3323333322340330 |
6 | 124002420044232 |
7 | 11115462103214 |
oct | 1513434371374 |
9 | 354214562372 |
10 | 113220121340 |
11 | 4401a896a17 |
12 | 19b39233678 |
13 | a8a4692151 |
14 | 56a0b29244 |
15 | 2e29b6c945 |
hex | 1a5c71f2fc |
113220121340 has 12 divisors (see below), whose sum is σ = 237762254856. Its totient is φ = 45288048528.
The previous prime is 113220121213. The next prime is 113220121351. The reversal of 113220121340 is 43121022311.
It is a Harshad number since it is a multiple of its sum of digits (20), and also a Moran number because the ratio is a prime number: 5661006067 = 113220121340 / (1 + 1 + 3 + 2 + 2 + 0 + 1 + 2 + 1 + 3 + 4 + 0).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2830503014 + ... + 2830503053.
It is an arithmetic number, because the mean of its divisors is an integer number (19813521238).
Almost surely, 2113220121340 is an apocalyptic number.
113220121340 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113220121340 is an abundant number, since it is smaller than the sum of its proper divisors (124542133516).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113220121340 is a wasteful number, since it uses less digits than its factorization.
113220121340 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5661006076 (or 5661006074 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 113220121340 its reverse (43121022311), we get a palindrome (156341143651).
The spelling of 113220121340 in words is "one hundred thirteen billion, two hundred twenty million, one hundred twenty-one thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •