Base | Representation |
---|---|
bin | 11011010100001010110111… |
… | …010110001101000010001000 |
3 | 120202100122002000112202221011 |
4 | 123110022313112031002020 |
5 | 111221231010144221300 |
6 | 1103300251545053304 |
7 | 34206226305542233 |
oct | 3324126726150210 |
9 | 522318060482834 |
10 | 120133311320200 |
11 | 3530728440a202 |
12 | 11582782a87234 |
13 | 52056a4348269 |
14 | 21946aa22041a |
15 | dd4e23055eba |
hex | 6d42b758d088 |
120133311320200 has 48 divisors (see below), whose sum is σ = 280422737577360. Its totient is φ = 47861877000000.
The previous prime is 120133311320173. The next prime is 120133311320207. The reversal of 120133311320200 is 2023113331021.
It is not an unprimeable number, because it can be changed into a prime (120133311320207) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1196496726 + ... + 1196597125.
It is an arithmetic number, because the mean of its divisors is an integer number (5842140366195).
Almost surely, 2120133311320200 is an apocalyptic number.
120133311320200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120133311320200 is an abundant number, since it is smaller than the sum of its proper divisors (160289426257160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120133311320200 is a wasteful number, since it uses less digits than its factorization.
120133311320200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2393094118 (or 2393094109 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 120133311320200 its reverse (2023113331021), we get a palindrome (122156424651221).
The spelling of 120133311320200 in words is "one hundred twenty trillion, one hundred thirty-three billion, three hundred eleven million, three hundred twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •