Base | Representation |
---|---|
bin | 110001010000111100… |
… | …0111011000101100000 |
3 | 101010002001110111201211 |
4 | 1202201320323011200 |
5 | 3213132042101320 |
6 | 120333543435504 |
7 | 10433463643243 |
oct | 1424170730540 |
9 | 333061414654 |
10 | 105795268960 |
11 | 4095a742487 |
12 | 18606755b94 |
13 | 9c90355984 |
14 | 51989b925a |
15 | 2b42dd155a |
hex | 18a1e3b160 |
105795268960 has 24 divisors (see below), whose sum is σ = 249941323296. Its totient is φ = 42318107520.
The previous prime is 105795268949. The next prime is 105795268961. The reversal of 105795268960 is 69862597501.
It is a super-2 number, since 2×1057952689602 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105795268895 and 105795268904.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105795268961) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 330610056 + ... + 330610375.
It is an arithmetic number, because the mean of its divisors is an integer number (10414221804).
Almost surely, 2105795268960 is an apocalyptic number.
105795268960 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105795268960 is an abundant number, since it is smaller than the sum of its proper divisors (144146054336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105795268960 is an equidigital number, since it uses as much as digits as its factorization.
105795268960 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 661220446 (or 661220438 counting only the distinct ones).
The product of its (nonzero) digits is 8164800, while the sum is 58.
The spelling of 105795268960 in words is "one hundred five billion, seven hundred ninety-five million, two hundred sixty-eight thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •