Base | Representation |
---|---|
bin | 1101001101010110… |
… | …0010110100111100 |
3 | 100011002202012001100 |
4 | 3103111202310330 |
5 | 24230140442002 |
6 | 1343455213100 |
7 | 153602305410 |
oct | 32325426474 |
9 | 10132665040 |
10 | 3545640252 |
11 | 155a470000 |
12 | 82b517190 |
13 | 4467594ab |
14 | 258c7cd40 |
15 | 15b42511c |
hex | d3562d3c |
3545640252 has 270 divisors, whose sum is σ = 11642368920. Its totient is φ = 891237600.
The previous prime is 3545640247. The next prime is 3545640277. The reversal of 3545640252 is 2520465453.
3545640252 is a `hidden beast` number, since 3 + 5 + 4 + 5 + 640 + 2 + 5 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 89 ways as a sum of consecutive naturals, for example, 114375477 + ... + 114375507.
Almost surely, 23545640252 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3545640252, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5821184460).
3545640252 is an abundant number, since it is smaller than the sum of its proper divisors (8096728668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3545640252 is a wasteful number, since it uses less digits than its factorization.
3545640252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123 (or 54 counting only the distinct ones).
The product of its (nonzero) digits is 144000, while the sum is 36.
The square root of 3545640252 is about 59545.2790068197. The cubic root of 3545640252 is about 1524.8655622060.
The spelling of 3545640252 in words is "three billion, five hundred forty-five million, six hundred forty thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •