Base | Representation |
---|---|
bin | 111000011001111100… |
… | …0000001010010111000 |
3 | 102120122201100110120020 |
4 | 1300303320001102320 |
5 | 3441033112021142 |
6 | 131351315330440 |
7 | 11515461656100 |
oct | 1606370012270 |
9 | 376581313506 |
10 | 121129407672 |
11 | 47409435899 |
12 | 1b585bb0a20 |
13 | b565193530 |
14 | 5c1133c200 |
15 | 323e1e9cec |
hex | 1c33e014b8 |
121129407672 has 192 divisors, whose sum is σ = 385794057600. Its totient is φ = 31404522240.
The previous prime is 121129407661. The next prime is 121129407713. The reversal of 121129407672 is 276704921121.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 834847 + ... + 969137.
It is an arithmetic number, because the mean of its divisors is an integer number (2009344050).
Almost surely, 2121129407672 is an apocalyptic number.
121129407672 is a gapful number since it is divisible by the number (12) 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 121129407672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (192897028800).
121129407672 is an abundant number, since it is smaller than the sum of its proper divisors (264664649928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121129407672 is a wasteful number, since it uses less digits than its factorization.
121129407672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 134386 (or 134375 counting only the distinct ones).
The product of its (nonzero) digits is 84672, while the sum is 42.
The spelling of 121129407672 in words is "one hundred twenty-one billion, one hundred twenty-nine million, four hundred seven thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •