Base | Representation |
---|---|
bin | 11010011000101010101100… |
… | …001011100000111101111100 |
3 | 120012212201122211202211011010 |
4 | 122120222230023200331330 |
5 | 110202232224131244400 |
6 | 1050450004501155220 |
7 | 33304632210300246 |
oct | 3230525413407574 |
9 | 505781584684133 |
10 | 116044315103100 |
11 | 33a8013267449a |
12 | 110221ba3bbb10 |
13 | 4c99c16690547 |
14 | 2092809437096 |
15 | d638a3deb450 |
hex | 698aac2e0f7c |
116044315103100 has 36 divisors (see below), whose sum is σ = 335754885032504. Its totient is φ = 30945150694080.
The previous prime is 116044315103083. The next prime is 116044315103147. The reversal of 116044315103100 is 1301513440611.
It is a super-2 number, since 2×1160443151031002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 193407191539 + ... + 193407192138.
Almost surely, 2116044315103100 is an apocalyptic number.
116044315103100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
116044315103100 is an abundant number, since it is smaller than the sum of its proper divisors (219710569929404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116044315103100 is a wasteful number, since it uses less digits than its factorization.
116044315103100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 386814383694 (or 386814383687 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 30.
Adding to 116044315103100 its reverse (1301513440611), we get a palindrome (117345828543711).
The spelling of 116044315103100 in words is "one hundred sixteen trillion, forty-four billion, three hundred fifteen million, one hundred three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •