Base | Representation |
---|---|
bin | 10100110110100111… |
… | …11010011001111000 |
3 | 1001220020112120120220 |
4 | 22123103322121320 |
5 | 140412034414112 |
6 | 5050533020040 |
7 | 544303140246 |
oct | 123323723170 |
9 | 31806476526 |
10 | 11195623032 |
11 | 4825701320 |
12 | 2205484620 |
13 | 109560b619 |
14 | 782c73796 |
15 | 457d3198c |
hex | 29b4fa678 |
11195623032 has 64 divisors (see below), whose sum is σ = 30710136960. Its totient is φ = 3372988800.
The previous prime is 11195623031. The next prime is 11195623039. The reversal of 11195623032 is 23032659111.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 11195622984 and 11195623002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11195623031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 76894 + ... + 168237.
It is an arithmetic number, because the mean of its divisors is an integer number (479845890).
Almost surely, 211195623032 is an apocalyptic number.
11195623032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11195623032 is an abundant number, since it is smaller than the sum of its proper divisors (19514513928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11195623032 is a wasteful number, since it uses less digits than its factorization.
11195623032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245324 (or 245320 counting only the distinct ones).
The product of its (nonzero) digits is 9720, while the sum is 33.
The spelling of 11195623032 in words is "eleven billion, one hundred ninety-five million, six hundred twenty-three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •