Base | Representation |
---|---|
bin | 10000010101001111000… |
… | …000100001111000011100 |
3 | 10222021212212000221222221 |
4 | 100111033000201320130 |
5 | 121341443333044400 |
6 | 2215325533115124 |
7 | 144040636424161 |
oct | 20251700417034 |
9 | 3867785027887 |
10 | 1122312003100 |
11 | 3a2a7395a182 |
12 | 161618028aa4 |
13 | 81aab46b582 |
14 | 3c46a864068 |
15 | 1e2d96aec1a |
hex | 1054f021e1c |
1122312003100 has 36 divisors (see below), whose sum is σ = 2519396951400. Its totient is φ = 433444634560.
The previous prime is 1122312003097. The next prime is 1122312003101. The reversal of 1122312003100 is 13002132211.
It is a super-2 number, since 2×11223120031002 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122312003101) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 193499170 + ... + 193504969.
It is an arithmetic number, because the mean of its divisors is an integer number (69983248650).
Almost surely, 21122312003100 is an apocalyptic number.
1122312003100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1122312003100 is an abundant number, since it is smaller than the sum of its proper divisors (1397084948300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122312003100 is a wasteful number, since it uses less digits than its factorization.
1122312003100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 387004182 (or 387004175 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1122312003100 its reverse (13002132211), we get a palindrome (1135314135311).
The spelling of 1122312003100 in words is "one trillion, one hundred twenty-two billion, three hundred twelve million, three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •