Base | Representation |
---|---|
bin | 110100100111111111… |
… | …1100110011100011110 |
3 | 101210200221112220211000 |
4 | 1221033333212130132 |
5 | 3322421333103202 |
6 | 123525554411130 |
7 | 11110344353136 |
oct | 1511777463436 |
9 | 353627486730 |
10 | 113011222302 |
11 | 43a22985a90 |
12 | 19a9b290aa6 |
13 | a870310454 |
14 | 56810abac6 |
15 | 2e1665691c |
hex | 1a4ffe671e |
113011222302 has 64 divisors (see below), whose sum is σ = 275607360000. Its totient is φ = 34040730240.
The previous prime is 113011222243. The next prime is 113011222307. The reversal of 113011222302 is 203222110311.
113011222302 is a `hidden beast` number, since 1 + 130 + 11 + 222 + 302 = 666.
113011222302 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113011222307) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 470427 + ... + 668822.
It is an arithmetic number, because the mean of its divisors is an integer number (4306365000).
Almost surely, 2113011222302 is an apocalyptic number.
113011222302 is an abundant number, since it is smaller than the sum of its proper divisors (162596137698).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113011222302 is a wasteful number, since it uses less digits than its factorization.
113011222302 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1139438 (or 1139432 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 113011222302 its reverse (203222110311), we get a palindrome (316233332613).
The spelling of 113011222302 in words is "one hundred thirteen billion, eleven million, two hundred twenty-two thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •