Base | Representation |
---|---|
bin | 1010100010111001… |
… | …01110100001111100 |
3 | 112121120000120200200 |
4 | 11101130232201330 |
5 | 43043312434122 |
6 | 2333440323500 |
7 | 260203360110 |
oct | 52134564174 |
9 | 15546016620 |
10 | 5661452412 |
11 | 2445818aa0 |
12 | 1120013590 |
13 | 6c2bc2555 |
14 | 3b9c83740 |
15 | 2320625ac |
hex | 15172e87c |
5661452412 has 144 divisors (see below), whose sum is σ = 18257471232. Its totient is φ = 1436279040.
The previous prime is 5661452333. The next prime is 5661452429. The reversal of 5661452412 is 2142541665.
5661452412 is a `hidden beast` number, since 5 + 6 + 614 + 5 + 24 + 12 = 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 47 ways as a sum of consecutive naturals, for example, 95448 + ... + 142944.
Almost surely, 25661452412 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 5661452412, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9128735616).
5661452412 is an abundant number, since it is smaller than the sum of its proper divisors (12596018820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5661452412 is a wasteful number, since it uses less digits than its factorization.
5661452412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47568 (or 47563 counting only the distinct ones).
The product of its digits is 57600, while the sum is 36.
The square root of 5661452412 is about 75242.6236384670. The cubic root of 5661452412 is about 1782.2800823428.
The spelling of 5661452412 in words is "five billion, six hundred sixty-one million, four hundred fifty-two thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •