Base | Representation |
---|---|
bin | 11011010011111110011110… |
… | …000100011111001000000000 |
3 | 120202022100201111100201000101 |
4 | 123103332132010133020000 |
5 | 111221021231044442144 |
6 | 1103250211155332144 |
7 | 34205245431236536 |
oct | 3323763604371000 |
9 | 522270644321011 |
10 | 120120002343424 |
11 | 35301674889a46 |
12 | 115800898b1054 |
13 | 5204362c54885 |
14 | 2193ba6826156 |
15 | dd48e49206d4 |
hex | 6d3f9e11f200 |
120120002343424 has 80 divisors (see below), whose sum is σ = 256407964956000. Its totient is φ = 56049710137344.
The previous prime is 120120002343317. The next prime is 120120002343529. The reversal of 120120002343424 is 424343200021021.
It is a junction number, because it is equal to n+sod(n) for n = 120120002343392 and 120120002343401.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 91496449 + ... + 92800000.
It is an arithmetic number, because the mean of its divisors is an integer number (3205099561950).
Almost surely, 2120120002343424 is an apocalyptic number.
It is an amenable number.
120120002343424 is an abundant number, since it is smaller than the sum of its proper divisors (136287962612576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120120002343424 is an equidigital number, since it uses as much as digits as its factorization.
120120002343424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184296553 (or 184296537 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 28.
Adding to 120120002343424 its reverse (424343200021021), we get a palindrome (544463202364445).
The spelling of 120120002343424 in words is "one hundred twenty trillion, one hundred twenty billion, two million, three hundred forty-three thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •