Base | Representation |
---|---|
bin | 110100100111111111… |
… | …0110010111011100110 |
3 | 101210200221011012101012 |
4 | 1221033332302323212 |
5 | 3322421304330202 |
6 | 123525550102222 |
7 | 11110342514030 |
oct | 1511776627346 |
9 | 353627135335 |
10 | 113011011302 |
11 | 43a22851502 |
12 | 19a9b1aa972 |
13 | a8702683b7 |
14 | 5681054c50 |
15 | 2e16614152 |
hex | 1a4ffb2ee6 |
113011011302 has 8 divisors (see below), whose sum is σ = 193733162256. Its totient is φ = 48433290552.
The previous prime is 113011011277. The next prime is 113011011307. The reversal of 113011011302 is 203110110311.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 8072215093 = 113011011302 / (1 + 1 + 3 + 0 + 1 + 1 + 0 + 1 + 1 + 3 + 0 + 2).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113011011307) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4036107533 + ... + 4036107560.
It is an arithmetic number, because the mean of its divisors is an integer number (24216645282).
Almost surely, 2113011011302 is an apocalyptic number.
113011011302 is a deficient number, since it is larger than the sum of its proper divisors (80722150954).
113011011302 is an equidigital number, since it uses as much as digits as its factorization.
113011011302 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8072215102.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 113011011302 its reverse (203110110311), we get a palindrome (316121121613).
Subtracting 113011011302 from its reverse (203110110311), we obtain a palindrome (90099099009).
The spelling of 113011011302 in words is "one hundred thirteen billion, eleven million, eleven thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •