Base | Representation |
---|---|
bin | 11110011111100011011… |
… | …11010100010101100100 |
3 | 10201011101022001011211012 |
4 | 33033301233110111210 |
5 | 114131224042003202 |
6 | 2121153301201352 |
7 | 135460536366200 |
oct | 17176157242544 |
9 | 3634338034735 |
10 | 1047732766052 |
11 | 374382917585 |
12 | 14b083700258 |
13 | 77a543c63cb |
14 | 389d39d7b00 |
15 | 1c3c205d152 |
hex | f3f1bd4564 |
1047732766052 has 144 divisors (see below), whose sum is σ = 2237612428800. Its totient is φ = 427198464000.
The previous prime is 1047732766049. The next prime is 1047732766079. The reversal of 1047732766052 is 2506672377401.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 872383052 + ... + 872384252.
It is an arithmetic number, because the mean of its divisors is an integer number (15538975200).
Almost surely, 21047732766052 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 1047732766052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1118806214400).
1047732766052 is an abundant number, since it is smaller than the sum of its proper divisors (1189879662748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1047732766052 is a wasteful number, since it uses less digits than its factorization.
1047732766052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2122 (or 2113 counting only the distinct ones).
The product of its (nonzero) digits is 2963520, while the sum is 50.
The spelling of 1047732766052 in words is "one trillion, forty-seven billion, seven hundred thirty-two million, seven hundred sixty-six thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.156 sec. • engine limits •