Base | Representation |
---|---|
bin | 10000010011001100010… |
… | …111001100110111100010 |
3 | 10222002020002122022210100 |
4 | 100103030113030313202 |
5 | 121323001223143132 |
6 | 2214324233443230 |
7 | 143632423006503 |
oct | 20231427146742 |
9 | 3862202568710 |
10 | 1120120131042 |
11 | 3a2049681270 |
12 | 161105b70516 |
13 | 8181c324663 |
14 | 3c2dd700baa |
15 | 1e20c04b37c |
hex | 104cc5ccde2 |
1120120131042 has 48 divisors (see below), whose sum is σ = 2647853488800. Its totient is φ = 339392289600.
The previous prime is 1120120131001. The next prime is 1120120131047. The reversal of 1120120131042 is 2401310210211.
1120120131042 is a `hidden beast` number, since 112 + 0 + 1 + 201 + 310 + 42 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (1120120131047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1479117 + ... + 2104287.
It is an arithmetic number, because the mean of its divisors is an integer number (55163614350).
Almost surely, 21120120131042 is an apocalyptic number.
1120120131042 is an abundant number, since it is smaller than the sum of its proper divisors (1527733357758).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1120120131042 is a wasteful number, since it uses less digits than its factorization.
1120120131042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 634239 (or 634236 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 1120120131042 its reverse (2401310210211), we get a palindrome (3521430341253).
The spelling of 1120120131042 in words is "one trillion, one hundred twenty billion, one hundred twenty million, one hundred thirty-one thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •