Base | Representation |
---|---|
bin | 10000001001111110111… |
… | …100010110101110010100 |
3 | 10221010200221002100001101 |
4 | 100021332330112232110 |
5 | 121142223204011200 |
6 | 2210011102035444 |
7 | 143132365312204 |
oct | 20117674265624 |
9 | 3833627070041 |
10 | 1110231313300 |
11 | 3989346a611a |
12 | 15b206278b84 |
13 | 80904694705 |
14 | 3ba42240404 |
15 | 1dd2dd0126a |
hex | 1027ef16b94 |
1110231313300 has 18 divisors (see below), whose sum is σ = 2409201950078. Its totient is φ = 444092525280.
The previous prime is 1110231313291. The next prime is 1110231313379. The reversal of 1110231313300 is 33131320111.
It can be written as a sum of positive squares in 3 ways, for example, as 62253244036 + 1047978069264 = 249506^2 + 1023708^2 .
It is a super-2 number, since 2×11102313133002 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5551156467 + ... + 5551156666.
Almost surely, 21110231313300 is an apocalyptic number.
1110231313300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1110231313300 is an abundant number, since it is smaller than the sum of its proper divisors (1298970636778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110231313300 is a wasteful number, since it uses less digits than its factorization.
1110231313300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11102313147 (or 11102313140 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1110231313300 its reverse (33131320111), we get a palindrome (1143362633411).
The spelling of 1110231313300 in words is "one trillion, one hundred ten billion, two hundred thirty-one million, three hundred thirteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •