Base | Representation |
---|---|
bin | 10000001100110001000… |
… | …110001000100101110100 |
3 | 10221102102020020121000200 |
4 | 100030301012020211310 |
5 | 121214333334040200 |
6 | 2211223432440500 |
7 | 143266430516535 |
oct | 20146106104564 |
9 | 3842366217020 |
10 | 1113220221300 |
11 | 39a12887aa20 |
12 | 15b8bb249130 |
13 | 80c8c994325 |
14 | 3bc4719a68c |
15 | 1de56403800 |
hex | 10331188974 |
1113220221300 has 108 divisors (see below), whose sum is σ = 3806538511776. Its totient is φ = 269871566400.
The previous prime is 1113220221299. The next prime is 1113220221359. The reversal of 1113220221300 is 31220223111.
1113220221300 is a `hidden beast` number, since 11 + 132 + 2 + 0 + 221 + 300 = 666.
It is a super-2 number, since 2×11132202213002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 56213344 + ... + 56233143.
Almost surely, 21113220221300 is an apocalyptic number.
1113220221300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1113220221300 is an abundant number, since it is smaller than the sum of its proper divisors (2693318290476).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113220221300 is a wasteful number, since it uses less digits than its factorization.
1113220221300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112446518 (or 112446508 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 1113220221300 its reverse (31220223111), we get a palindrome (1144440444411).
The spelling of 1113220221300 in words is "one trillion, one hundred thirteen billion, two hundred twenty million, two hundred twenty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •