Base | Representation |
---|---|
bin | 110100101000000001… |
… | …1010111100111010100 |
3 | 101210201000102002212022 |
4 | 1221100003113213110 |
5 | 3322422111211012 |
6 | 123530031512312 |
7 | 11110355636123 |
oct | 1512003274724 |
9 | 353630362768 |
10 | 113012210132 |
11 | 43a234a0178 |
12 | 19a9b688698 |
13 | a870597c73 |
14 | 5681287aba |
15 | 2e1679e472 |
hex | 1a500d79d4 |
113012210132 has 12 divisors (see below), whose sum is σ = 198114129780. Its totient is φ = 56408173056.
The previous prime is 113012210131. The next prime is 113012210147. The reversal of 113012210132 is 231012210311.
It can be written as a sum of positive squares in 2 ways, for example, as 70211220676 + 42800989456 = 264974^2 + 206884^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 113012210132.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113012210131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24480407 + ... + 24485022.
It is an arithmetic number, because the mean of its divisors is an integer number (16509510815).
Almost surely, 2113012210132 is an apocalyptic number.
It is an amenable number.
113012210132 is a deficient number, since it is larger than the sum of its proper divisors (85101919648).
113012210132 is a wasteful number, since it uses less digits than its factorization.
113012210132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48966010 (or 48966008 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 113012210132 its reverse (231012210311), we get a palindrome (344024420443).
The spelling of 113012210132 in words is "one hundred thirteen billion, twelve million, two hundred ten thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •