Base | Representation |
---|---|
bin | 10000010011001100010… |
… | …111111000100101010100 |
3 | 10222002020002222102102010 |
4 | 100103030113320211110 |
5 | 121323001244410400 |
6 | 2214324241344220 |
7 | 143632424353521 |
oct | 20231427704524 |
9 | 3862202872363 |
10 | 1120120310100 |
11 | 3a2049793850 |
12 | 161106038070 |
13 | 8181c387ccc |
14 | 3c2dd74a148 |
15 | 1e20c084450 |
hex | 104cc5f8954 |
1120120310100 has 144 divisors (see below), whose sum is σ = 3570513097536. Its totient is φ = 268855680000.
The previous prime is 1120120310077. The next prime is 1120120310107. The reversal of 1120120310100 is 10130210211.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120120310107) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1347049 + ... + 2013648.
It is an arithmetic number, because the mean of its divisors is an integer number (24795229844).
Almost surely, 21120120310100 is an apocalyptic number.
1120120310100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1120120310100 is an abundant number, since it is smaller than the sum of its proper divisors (2450392787436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1120120310100 is a wasteful number, since it uses less digits than its factorization.
1120120310100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3360826 (or 3360819 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 1120120310100 its reverse (10130210211), we get a palindrome (1130250520311).
The spelling of 1120120310100 in words is "one trillion, one hundred twenty billion, one hundred twenty million, three hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •