Base | Representation |
---|---|
bin | 110001001100101101… |
… | …0101110001011010000 |
3 | 101002201011000022021020 |
4 | 1202121122232023100 |
5 | 3212334200242112 |
6 | 120311505155440 |
7 | 10430116551555 |
oct | 1423132561320 |
9 | 332634008236 |
10 | 105653134032 |
11 | 408974923a6 |
12 | 1858702bb80 |
13 | 9c69a7b974 |
14 | 5183b7aa2c |
15 | 2b356a748c |
hex | 18996ae2d0 |
105653134032 has 20 divisors (see below), whose sum is σ = 272937263040. Its totient is φ = 35217711328.
The previous prime is 105653134021. The next prime is 105653134079. The reversal of 105653134032 is 230431356501.
It is a super-2 number, since 2×1056531340322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105653133984 and 105653134002.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1100553432 + ... + 1100553527.
It is an arithmetic number, because the mean of its divisors is an integer number (13646863152).
Almost surely, 2105653134032 is an apocalyptic number.
105653134032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
105653134032 is an abundant number, since it is smaller than the sum of its proper divisors (167284129008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105653134032 is a wasteful number, since it uses less digits than its factorization.
105653134032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2201106970 (or 2201106964 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 33.
The spelling of 105653134032 in words is "one hundred five billion, six hundred fifty-three million, one hundred thirty-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •