Base | Representation |
---|---|
bin | 10000101011010011111011… |
… | …10010010001110000000000 |
3 | 11210211212020102222022200210 |
4 | 20111221331302101300000 |
5 | 14301320331010331102 |
6 | 205555044404114120 |
7 | 10503334520104041 |
oct | 1025517562216000 |
9 | 153755212868623 |
10 | 36672541105152 |
11 | 10759812447a77 |
12 | 4143473995940 |
13 | 176028a165bb4 |
14 | 90ad637068c8 |
15 | 438e0c33a36c |
hex | 215a7dc91c00 |
36672541105152 has 44 divisors (see below), whose sum is σ = 97745692250696. Its totient is φ = 12224180367360.
The previous prime is 36672541105147. The next prime is 36672541105199. The reversal of 36672541105152 is 25150114527663.
It is a super-2 number, since 2×366725411051522 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 5968834999 + ... + 5968841142.
Almost surely, 236672541105152 is an apocalyptic number.
36672541105152 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
36672541105152 is an abundant number, since it is smaller than the sum of its proper divisors (61073151145544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
36672541105152 is a wasteful number, since it uses less digits than its factorization.
36672541105152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11937676164 (or 11937676146 counting only the distinct ones).
The product of its (nonzero) digits is 1512000, while the sum is 48.
The spelling of 36672541105152 in words is "thirty-six trillion, six hundred seventy-two billion, five hundred forty-one million, one hundred five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •