Base | Representation |
---|---|
bin | 110001001100001110… |
… | …0011011001001000100 |
3 | 101002200000021121111101 |
4 | 1202120130123021010 |
5 | 3212321010200030 |
6 | 120310123145444 |
7 | 10426531003621 |
oct | 1423034331104 |
9 | 332600247441 |
10 | 105636803140 |
11 | 408892487a0 |
12 | 18581675284 |
13 | 9c6658160b |
14 | 5181929348 |
15 | 2b3402d7ca |
hex | 189871b244 |
105636803140 has 24 divisors (see below), whose sum is σ = 242004313152. Its totient is φ = 38413382880.
The previous prime is 105636803093. The next prime is 105636803219. The reversal of 105636803140 is 41308636501.
It is a super-2 number, since 2×1056368031402 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 105636803140.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 240083424 + ... + 240083863.
It is an arithmetic number, because the mean of its divisors is an integer number (10083513048).
Almost surely, 2105636803140 is an apocalyptic number.
105636803140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105636803140 is an abundant number, since it is smaller than the sum of its proper divisors (136367510012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105636803140 is a wasteful number, since it uses less digits than its factorization.
105636803140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 480167307 (or 480167305 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 37.
The spelling of 105636803140 in words is "one hundred five billion, six hundred thirty-six million, eight hundred three thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.198 sec. • engine limits •