Base | Representation |
---|---|
bin | 100001100011100100… |
… | …100001000001101100 |
3 | 10110000000021121101202 |
4 | 201203210201001230 |
5 | 1042242221131322 |
6 | 24315125225032 |
7 | 2413602054560 |
oct | 414344410154 |
9 | 113000247352 |
10 | 36030255212 |
11 | 1430a15a026 |
12 | 6b96562178 |
13 | 35227c5053 |
14 | 1a5b2916a0 |
15 | e0d23b292 |
hex | 86392106c |
36030255212 has 12 divisors (see below), whose sum is σ = 72060510480. Its totient is φ = 15441537936.
The previous prime is 36030255203. The next prime is 36030255221. The reversal of 36030255212 is 21255203063.
It is an interprime number because it is at equal distance from previous prime (36030255203) and next prime (36030255221).
36030255212 is an admirable number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 643397387 + ... + 643397442.
It is an arithmetic number, because the mean of its divisors is an integer number (6005042540).
Almost surely, 236030255212 is an apocalyptic number.
It is an amenable number.
36030255212 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
36030255212 is a wasteful number, since it uses less digits than its factorization.
36030255212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1286794840 (or 1286794838 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 29.
Adding to 36030255212 its reverse (21255203063), we get a palindrome (57285458275).
It can be divided in two parts, 360302 and 55212, that added together give a palindrome (415514).
The spelling of 36030255212 in words is "thirty-six billion, thirty million, two hundred fifty-five thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •