Base | Representation |
---|---|
bin | 110111111100001100… |
… | …0101000000010010000 |
3 | 102111002011021110102020 |
4 | 1233320120220002100 |
5 | 3432012104301000 |
6 | 131104303051440 |
7 | 11451652250244 |
oct | 1577030500220 |
9 | 374064243366 |
10 | 120131322000 |
11 | 46a46aaa2a8 |
12 | 1b3478a0b80 |
13 | b4364767b1 |
14 | 5b5896c424 |
15 | 31d1795ba0 |
hex | 1bf8628090 |
120131322000 has 80 divisors (see below), whose sum is σ = 387303401472. Its totient is φ = 32035017600.
The previous prime is 120131321993. The next prime is 120131322007. The reversal of 120131322000 is 223131021.
It is an interprime number because it is at equal distance from previous prime (120131321993) and next prime (120131322007).
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (120131322007) 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, 10004944 + ... + 10016943.
Almost surely, 2120131322000 is an apocalyptic number.
120131322000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120131322000 is an abundant number, since it is smaller than the sum of its proper divisors (267172079472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120131322000 is a wasteful number, since it uses less digits than its factorization.
120131322000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20021913 (or 20021897 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 120131322000 its reverse (223131021), we get a palindrome (120354453021).
The spelling of 120131322000 in words is "one hundred twenty billion, one hundred thirty-one million, three hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •