Base | Representation |
---|---|
bin | 11011010010111110101101… |
… | …111111101001010011110100 |
3 | 120202001211000221021001022010 |
4 | 123102332231333221103310 |
5 | 111213411033302030030 |
6 | 1103154530513004220 |
7 | 34200303216221025 |
oct | 3322765577512364 |
9 | 522054027231263 |
10 | 120051550033140 |
11 | 35285638290090 |
12 | 1156a965253670 |
13 | 51caa7435916b |
14 | 21907515a8c4c |
15 | dd2c3a1296b0 |
hex | 6d2fadfe94f4 |
120051550033140 has 96 divisors (see below), whose sum is σ = 372918220254720. Its totient is φ = 28610127990400.
The previous prime is 120051550033139. The next prime is 120051550033159. The reversal of 120051550033140 is 41330055150021.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 120051550033098 and 120051550033107.
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, 1541455026 + ... + 1541532905.
It is an arithmetic number, because the mean of its divisors is an integer number (3884564794320).
Almost surely, 2120051550033140 is an apocalyptic number.
120051550033140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120051550033140 is an abundant number, since it is smaller than the sum of its proper divisors (252866670221580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120051550033140 is a wasteful number, since it uses less digits than its factorization.
120051550033140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3082988013 (or 3082988011 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 30.
The spelling of 120051550033140 in words is "one hundred twenty trillion, fifty-one billion, five hundred fifty million, thirty-three thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •