Base | Representation |
---|---|
bin | 110000011010110111… |
… | …1101101110001010000 |
3 | 100221101121102211002100 |
4 | 1200311233231301100 |
5 | 3200423103301132 |
6 | 115433531520400 |
7 | 10340513125665 |
oct | 1406557556120 |
9 | 327347384070 |
10 | 103980915792 |
11 | 40109575056 |
12 | 1819abb9100 |
13 | 9a614ab810 |
14 | 5065a47a6c |
15 | 2a8899037c |
hex | 1835bedc50 |
103980915792 has 60 divisors (see below), whose sum is σ = 313386932404. Its totient is φ = 31994127360.
The previous prime is 103980915781. The next prime is 103980915823. The reversal of 103980915792 is 297519089301.
103980915792 is a `hidden beast` number, since 10 + 398 + 0 + 9 + 157 + 92 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 63425400336 + 40555515456 = 251844^2 + 201384^2 .
It is a super-3 number, since 3×1039809157923 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 27770809 + ... + 27774552.
Almost surely, 2103980915792 is an apocalyptic number.
103980915792 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103980915792 is an abundant number, since it is smaller than the sum of its proper divisors (209406016612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103980915792 is a wasteful number, since it uses less digits than its factorization.
103980915792 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55545388 (or 55545379 counting only the distinct ones).
The product of its (nonzero) digits is 1224720, while the sum is 54.
The spelling of 103980915792 in words is "one hundred three billion, nine hundred eighty million, nine hundred fifteen thousand, seven hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •