Base | Representation |
---|---|
bin | 111101111111011… |
… | …111010111111000 |
3 | 2200111001012112100 |
4 | 331333133113320 |
5 | 4112223210002 |
6 | 251111543400 |
7 | 34526211453 |
oct | 7577372770 |
9 | 2614035470 |
10 | 1040053752 |
11 | 4940a0861 |
12 | 25038ab60 |
13 | 13762232a |
14 | 9c1b649a |
15 | 6149411c |
hex | 3dfdf5f8 |
1040053752 has 24 divisors (see below), whose sum is σ = 2816812440. Its totient is φ = 346684560.
The previous prime is 1040053717. The next prime is 1040053753. The reversal of 1040053752 is 2573500401.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1040053753) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 7222524 + ... + 7222667.
It is an arithmetic number, because the mean of its divisors is an integer number (117367185).
Almost surely, 21040053752 is an apocalyptic number.
1040053752 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1040053752 is an abundant number, since it is smaller than the sum of its proper divisors (1776758688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1040053752 is a wasteful number, since it uses less digits than its factorization.
1040053752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14445203 (or 14445196 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 27.
The square root of 1040053752 is about 32249.8643718078. The cubic root of 1040053752 is about 1013.1768584375.
The spelling of 1040053752 in words is "one billion, forty million, fifty-three thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •