Base | Representation |
---|---|
bin | 110001001110000101… |
… | …0000000100101000000 |
3 | 101002211100110211121102 |
4 | 1202130022000211000 |
5 | 3212432431201413 |
6 | 120320230113532 |
7 | 10431215252345 |
oct | 1423412004500 |
9 | 332740424542 |
10 | 105699084608 |
11 | 40910417787 |
12 | 1859a4ab8a8 |
13 | 9c76449b60 |
14 | 5189cdc7cc |
15 | 2b39732458 |
hex | 189c280940 |
105699084608 has 28 divisors (see below), whose sum is σ = 225880978260. Its totient is φ = 48784192512.
The previous prime is 105699084599. The next prime is 105699084649. The reversal of 105699084608 is 806480996501.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 22043934784 + 83655149824 = 148472^2 + 289232^2 .
It is a super-2 number, since 2×1056990846082 (a number of 23 digits) contains 22 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 (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 63520253 + ... + 63521916.
It is an arithmetic number, because the mean of its divisors is an integer number (8067177795).
Almost surely, 2105699084608 is an apocalyptic number.
It is an amenable number.
105699084608 is an abundant number, since it is smaller than the sum of its proper divisors (120181893652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105699084608 is a wasteful number, since it uses less digits than its factorization.
105699084608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127042194 (or 127042184 counting only the distinct ones).
The product of its (nonzero) digits is 3732480, while the sum is 56.
The spelling of 105699084608 in words is "one hundred five billion, six hundred ninety-nine million, eighty-four thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •