Base | Representation |
---|---|
bin | 11110100100001010001… |
… | …11000100101010010100 |
3 | 10201101202121110002000110 |
4 | 33102011013010222110 |
5 | 114201310020302202 |
6 | 2122242503043020 |
7 | 135606031166646 |
oct | 17220507045224 |
9 | 3641677402013 |
10 | 1050205244052 |
11 | 375431532928 |
12 | 14b653740470 |
13 | 7805970a743 |
14 | 38b8a122896 |
15 | 1c4b914e26c |
hex | f4851c4a94 |
1050205244052 has 96 divisors (see below), whose sum is σ = 2522503855872. Its totient is φ = 339933408256.
The previous prime is 1050205244051. The next prime is 1050205244117. The reversal of 1050205244052 is 2504425020501.
It is a super-2 number, since 2×10502052440522 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1050205244051) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 24726178 + ... + 24768614.
It is an arithmetic number, because the mean of its divisors is an integer number (26276081832).
Almost surely, 21050205244052 is an apocalyptic number.
1050205244052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1050205244052 is an abundant number, since it is smaller than the sum of its proper divisors (1472298611820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1050205244052 is a wasteful number, since it uses less digits than its factorization.
1050205244052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42897 (or 42895 counting only the distinct ones).
The product of its (nonzero) digits is 16000, while the sum is 30.
The spelling of 1050205244052 in words is "one trillion, fifty billion, two hundred five million, two hundred forty-four thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •