Base | Representation |
---|---|
bin | 110100111011100011… |
… | …0111101001110111100 |
3 | 101212101200101100112211 |
4 | 1221313012331032330 |
5 | 3330242332241301 |
6 | 124115040110204 |
7 | 11132533325500 |
oct | 1516706751674 |
9 | 355350340484 |
10 | 113667462076 |
11 | 4422a356703 |
12 | 1a043005364 |
13 | a94626a5cc |
14 | 57042d4300 |
15 | 2e54083051 |
hex | 1a771bd3bc |
113667462076 has 108 divisors (see below), whose sum is σ = 244650865536. Its totient is φ = 46068220800.
The previous prime is 113667462067. The next prime is 113667462091. The reversal of 113667462076 is 670264766311.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a congruent number.
It is an unprimeable number.
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 35 ways as a sum of consecutive naturals, for example, 53844261 + ... + 53846371.
It is an arithmetic number, because the mean of its divisors is an integer number (2265285792).
Almost surely, 2113667462076 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 113667462076, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (122325432768).
113667462076 is an abundant number, since it is smaller than the sum of its proper divisors (130983403460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113667462076 is a wasteful number, since it uses less digits than its factorization.
113667462076 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2928 (or 2900 counting only the distinct ones).
The product of its (nonzero) digits is 1524096, while the sum is 49.
The spelling of 113667462076 in words is "one hundred thirteen billion, six hundred sixty-seven million, four hundred sixty-two thousand, seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •