Base | Representation |
---|---|
bin | 110100101000000011… |
… | …1001110111100110101 |
3 | 101210201002022120120010 |
4 | 1221100013032330311 |
5 | 3322422341120341 |
6 | 123530105330433 |
7 | 11110400355543 |
oct | 1512007167465 |
9 | 353632276503 |
10 | 113013223221 |
11 | 43a24022338 |
12 | 19a9ba96a19 |
13 | a870861122 |
14 | 568146cd93 |
15 | 2e168ee716 |
hex | 1a501cef35 |
113013223221 has 8 divisors (see below), whose sum is σ = 151019899200. Its totient is φ = 75174348032.
The previous prime is 113013223207. The next prime is 113013223229. The reversal of 113013223221 is 122322310311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 113013223221 - 27 = 113013223093 is a prime.
It is a super-2 number, since 2×1130132232212 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113013223229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41948625 + ... + 41951318.
It is an arithmetic number, because the mean of its divisors is an integer number (18877487400).
Almost surely, 2113013223221 is an apocalyptic number.
It is an amenable number.
113013223221 is a deficient number, since it is larger than the sum of its proper divisors (38006675979).
113013223221 is an equidigital number, since it uses as much as digits as its factorization.
113013223221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83900395.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 113013223221 its reverse (122322310311), we get a palindrome (235335533532).
The spelling of 113013223221 in words is "one hundred thirteen billion, thirteen million, two hundred twenty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •