Base | Representation |
---|---|
bin | 111110101101100… |
… | …100011100011000 |
3 | 2201022202220100020 |
4 | 332231210130120 |
5 | 4123321230034 |
6 | 252222510440 |
7 | 35033661366 |
oct | 7655443430 |
9 | 2638686306 |
10 | 1052133144 |
11 | 49a9a1227 |
12 | 254435420 |
13 | 139c914ba |
14 | 9da3c636 |
15 | 6257d249 |
hex | 3eb64718 |
1052133144 has 64 divisors (see below), whose sum is σ = 2703788640. Its totient is φ = 340976640.
The previous prime is 1052133133. The next prime is 1052133161. The reversal of 1052133144 is 4413312501.
It is a happy number.
It is a super-2 number, since 2×10521331442 = 2213968305406649472, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 310242 + ... + 313614.
Almost surely, 21052133144 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 1052133144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1351894320).
1052133144 is an abundant number, since it is smaller than the sum of its proper divisors (1651655496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1052133144 is a wasteful number, since it uses less digits than its factorization.
1052133144 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3740 (or 3736 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 24.
The square root of 1052133144 is about 32436.6019182035. The cubic root of 1052133144 is about 1017.0841832336.
Adding to 1052133144 its reverse (4413312501), we get a palindrome (5465445645).
The spelling of 1052133144 in words is "one billion, fifty-two million, one hundred thirty-three thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •