Base | Representation |
---|---|
bin | 10000001100101011001… |
… | …000101010101100110000 |
3 | 10221102011021002002202220 |
4 | 100030223020222230300 |
5 | 121214132234101000 |
6 | 2211205501241040 |
7 | 143264104526433 |
oct | 20145310525460 |
9 | 3842137062686 |
10 | 1113120222000 |
11 | 39a087389a76 |
12 | 15b891863180 |
13 | 80c75050c47 |
14 | 3bc37ba981a |
15 | 1de4c74e1a0 |
hex | 1032b22ab30 |
1113120222000 has 160 divisors (see below), whose sum is σ = 3589270224384. Its totient is φ = 296784864000.
The previous prime is 1113120221933. The next prime is 1113120222031. The reversal of 1113120222000 is 2220213111.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 54535797 + ... + 54556203.
Almost surely, 21113120222000 is an apocalyptic number.
1113120222000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1113120222000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1794635112192).
1113120222000 is an abundant number, since it is smaller than the sum of its proper divisors (2476150002384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113120222000 is a wasteful number, since it uses less digits than its factorization.
1113120222000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29524 (or 29508 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1113120222000 its reverse (2220213111), we get a palindrome (1115340435111).
The spelling of 1113120222000 in words is "one trillion, one hundred thirteen billion, one hundred twenty million, two hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •