Base | Representation |
---|---|
bin | 111000001100010000… |
… | …0110100111000000000 |
3 | 102112110201112112202020 |
4 | 1300120200310320000 |
5 | 3434113101431111 |
6 | 131234000121440 |
7 | 11501215663113 |
oct | 1603040647000 |
9 | 375421475666 |
10 | 120670342656 |
11 | 471a3298516 |
12 | 1b478306280 |
13 | b4c1041726 |
14 | 5baa3a057a |
15 | 3213c6a906 |
hex | 1c18834e00 |
120670342656 has 160 divisors (see below), whose sum is σ = 324770942496. Its totient is φ = 39813120000.
The previous prime is 120670342643. The next prime is 120670342657. The reversal of 120670342656 is 656243076021.
It is a super-2 number, since 2×1206703426562 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120670342657) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 67000956 + ... + 67002756.
Almost surely, 2120670342656 is an apocalyptic number.
120670342656 is a gapful number since it is divisible by the number (16) 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 120670342656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (162385471248).
120670342656 is an abundant number, since it is smaller than the sum of its proper divisors (204100599840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120670342656 is a wasteful number, since it uses less digits than its factorization.
120670342656 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2244 (or 2228 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 42.
The spelling of 120670342656 in words is "one hundred twenty billion, six hundred seventy million, three hundred forty-two thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •