Base | Representation |
---|---|
bin | 110100101101101001… |
… | …0001100111001011000 |
3 | 101211012010222201201000 |
4 | 1221123102030321120 |
5 | 3323313331212033 |
6 | 124000442425000 |
7 | 11115134426025 |
oct | 1513322147130 |
9 | 354163881630 |
10 | 113200647768 |
11 | 4400a8a615a |
12 | 19b32802160 |
13 | a8a0634520 |
14 | 569c2da54c |
15 | 2e280c2a13 |
hex | 1a5b48ce58 |
113200647768 has 128 divisors (see below), whose sum is σ = 342921600000. Its totient is φ = 34390002816.
The previous prime is 113200647709. The next prime is 113200647797. The reversal of 113200647768 is 867746002311.
113200647768 is a `hidden beast` number, since 113 + 2 + 0 + 0 + 6 + 477 + 68 = 666.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 33318 + ... + 476981.
It is an arithmetic number, because the mean of its divisors is an integer number (2679075000).
Almost surely, 2113200647768 is an apocalyptic number.
113200647768 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 113200647768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (171460800000).
113200647768 is an abundant number, since it is smaller than the sum of its proper divisors (229720952232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113200647768 is a wasteful number, since it uses less digits than its factorization.
113200647768 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 510406 (or 510396 counting only the distinct ones).
The product of its (nonzero) digits is 338688, while the sum is 45.
The spelling of 113200647768 in words is "one hundred thirteen billion, two hundred million, six hundred forty-seven thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •