Base | Representation |
---|---|
bin | 110000111011010011… |
… | …0101110001000000000 |
3 | 101001012110000010122000 |
4 | 1201312212232020000 |
5 | 3210140140430432 |
6 | 120133522544000 |
7 | 10406465263425 |
oct | 1416646561000 |
9 | 331173003560 |
10 | 105069076992 |
11 | 40617833730 |
12 | 18443508000 |
13 | 9ba5a75999 |
14 | 512a383d4c |
15 | 2aee28857c |
hex | 18769ae200 |
105069076992 has 160 divisors (see below), whose sum is σ = 339286052160. Its totient is φ = 31839068160.
The previous prime is 105069076979. The next prime is 105069077011. The reversal of 105069076992 is 299670960501.
It is a super-2 number, since 2×1050690769922 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 193413 + ... + 497540.
It is an arithmetic number, because the mean of its divisors is an integer number (2120537826).
Almost surely, 2105069076992 is an apocalyptic number.
105069076992 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
105069076992 is an abundant number, since it is smaller than the sum of its proper divisors (234216975168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105069076992 is an equidigital number, since it uses as much as digits as its factorization.
105069076992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 690991 (or 690969 counting only the distinct ones).
The product of its (nonzero) digits is 1837080, while the sum is 54.
The spelling of 105069076992 in words is "one hundred five billion, sixty-nine million, seventy-six thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •