Base | Representation |
---|---|
bin | 110111111100010100… |
… | …1001011011011110100 |
3 | 102111002110102220211001 |
4 | 1233320221023123310 |
5 | 3432014212130200 |
6 | 131104540053044 |
7 | 11452034162254 |
oct | 1577051133364 |
9 | 374073386731 |
10 | 120135661300 |
11 | 46a494a34a6 |
12 | 1b349234184 |
13 | b437335925 |
14 | 5b5937b964 |
15 | 31d1d5176a |
hex | 1bf8a4b6f4 |
120135661300 has 72 divisors (see below), whose sum is σ = 267100404480. Its totient is φ = 46880035200.
The previous prime is 120135661259. The next prime is 120135661309. The reversal of 120135661300 is 3166531021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120135661309) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1420606 + ... + 1502794.
It is an arithmetic number, because the mean of its divisors is an integer number (3709727840).
Almost surely, 2120135661300 is an apocalyptic number.
120135661300 is a gapful number since it is divisible by the number (10) 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 120135661300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (133550202240).
120135661300 is an abundant number, since it is smaller than the sum of its proper divisors (146964743180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120135661300 is a wasteful number, since it uses less digits than its factorization.
120135661300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82561 (or 82554 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 28.
The spelling of 120135661300 in words is "one hundred twenty billion, one hundred thirty-five million, six hundred sixty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •