Base | Representation |
---|---|
bin | 110100101101101111… |
… | …1110001000111110110 |
3 | 101211012101200101222010 |
4 | 1221123133301013312 |
5 | 3323320234012042 |
6 | 124001050545050 |
7 | 11115206600100 |
oct | 1513337610766 |
9 | 354171611863 |
10 | 113204204022 |
11 | 44011905008 |
12 | 19b33a38186 |
13 | a8a12ab110 |
14 | 569c984570 |
15 | 2e2857659c |
hex | 1a5b7f11f6 |
113204204022 has 96 divisors (see below), whose sum is σ = 295964589312. Its totient is φ = 28557942336.
The previous prime is 113204204021. The next prime is 113204204101. The reversal of 113204204022 is 220402402311.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 113204204022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113204204021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 555988 + ... + 731799.
It is an arithmetic number, because the mean of its divisors is an integer number (3082964472).
Almost surely, 2113204204022 is an apocalyptic number.
113204204022 is an abundant number, since it is smaller than the sum of its proper divisors (182760385290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113204204022 is a wasteful number, since it uses less digits than its factorization.
113204204022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1287842 (or 1287835 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 113204204022 its reverse (220402402311), we get a palindrome (333606606333).
The spelling of 113204204022 in words is "one hundred thirteen billion, two hundred four million, two hundred four thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •