Base | Representation |
---|---|
bin | 10000000000011101101… |
… | …110010111110101111000 |
3 | 10220011022121111020122221 |
4 | 100000131232113311320 |
5 | 121010310120321240 |
6 | 2201200542453424 |
7 | 142321165321456 |
oct | 20003556276570 |
9 | 3804277436587 |
10 | 1100010323320 |
11 | 39456a172067 |
12 | 159233294274 |
13 | 7c965c8104c |
14 | 3b3529d39d6 |
15 | 1d93183ea4a |
hex | 1001db97d78 |
1100010323320 has 64 divisors (see below), whose sum is σ = 2540504852640. Its totient is φ = 428505792000.
The previous prime is 1100010323233. The next prime is 1100010323327. The reversal of 1100010323320 is 233230100011.
It is a super-2 number, since 2×11000103233202 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1100010323294 and 1100010323303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100010323327) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1985362 + ... + 2478241.
Almost surely, 21100010323320 is an apocalyptic number.
1100010323320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1100010323320 is an abundant number, since it is smaller than the sum of its proper divisors (1440494529320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100010323320 is a wasteful number, since it uses less digits than its factorization.
1100010323320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4463776 (or 4463772 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 1100010323320 its reverse (233230100011), we get a palindrome (1333240423331).
The spelling of 1100010323320 in words is "one trillion, one hundred billion, ten million, three hundred twenty-three thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •