Base | Representation |
---|---|
bin | 111000010100110010… |
… | …0001010000100001010 |
3 | 102120012122212012211020 |
4 | 1300221210022010022 |
5 | 3440204321203204 |
6 | 131322220013310 |
7 | 11511261451563 |
oct | 1605144120412 |
9 | 376178765736 |
10 | 120956428554 |
11 | 4732a829045 |
12 | 1b538091236 |
13 | b5383aa220 |
14 | 5bd639116a |
15 | 322de2bbd9 |
hex | 1c2990a10a |
120956428554 has 64 divisors (see below), whose sum is σ = 266990290560. Its totient is φ = 36294036480.
The previous prime is 120956428429. The next prime is 120956428559. The reversal of 120956428554 is 455824659021.
It is a junction number, because it is equal to n+sod(n) for n = 120956428497 and 120956428506.
It is not an unprimeable number, because it can be changed into a prime (120956428559) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9008454 + ... + 9021870.
It is an arithmetic number, because the mean of its divisors is an integer number (4171723290).
Almost surely, 2120956428554 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 120956428554, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (133495145280).
120956428554 is an abundant number, since it is smaller than the sum of its proper divisors (146033862006).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120956428554 is a wasteful number, since it uses less digits than its factorization.
120956428554 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16295.
The product of its (nonzero) digits is 3456000, while the sum is 51.
The spelling of 120956428554 in words is "one hundred twenty billion, nine hundred fifty-six million, four hundred twenty-eight thousand, five hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •