Base | Representation |
---|---|
bin | 110001010101100010… |
… | …1001111111011111000 |
3 | 101010110210200000010120 |
4 | 1202223011033323320 |
5 | 3213441032320112 |
6 | 120401133213240 |
7 | 10440345564033 |
oct | 1425305177370 |
9 | 333423600116 |
10 | 105949495032 |
11 | 40a29800847 |
12 | 1864a331220 |
13 | 9cb62a42c4 |
14 | 51b128401a |
15 | 2b516e7e8c |
hex | 18ab14fef8 |
105949495032 has 32 divisors (see below), whose sum is σ = 276389988480. Its totient is φ = 33780998240.
The previous prime is 105949495019. The next prime is 105949495061. The reversal of 105949495032 is 230594949501.
It is a super-2 number, since 2×1059494950322 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
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, 95968194 + ... + 95969297.
It is an arithmetic number, because the mean of its divisors is an integer number (8637187140).
Almost surely, 2105949495032 is an apocalyptic number.
105949495032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
105949495032 is an abundant number, since it is smaller than the sum of its proper divisors (170440493448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105949495032 is a wasteful number, since it uses less digits than its factorization.
105949495032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191937523 (or 191937519 counting only the distinct ones).
The product of its (nonzero) digits is 1749600, while the sum is 51.
The spelling of 105949495032 in words is "one hundred five billion, nine hundred forty-nine million, four hundred ninety-five thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •