Base | Representation |
---|---|
bin | 111110000111110… |
… | …110000010100100 |
3 | 2200122011110122022 |
4 | 332013312002210 |
5 | 4113303244443 |
6 | 251230522312 |
7 | 34553632340 |
oct | 7607660244 |
9 | 2618143568 |
10 | 1042243748 |
11 | 495357177 |
12 | 251066398 |
13 | 137c0b0a0 |
14 | 9c5c6620 |
15 | 61777e68 |
hex | 3e1f60a4 |
1042243748 has 48 divisors (see below), whose sum is σ = 2264787840. Its totient is φ = 408651264.
The previous prime is 1042243747. The next prime is 1042243751. The reversal of 1042243748 is 8473422401.
1042243748 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (1042243747) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28463 + ... + 53801.
It is an arithmetic number, because the mean of its divisors is an integer number (47183080).
Almost surely, 21042243748 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 1042243748, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1132393920).
1042243748 is an abundant number, since it is smaller than the sum of its proper divisors (1222544092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1042243748 is a wasteful number, since it uses less digits than its factorization.
1042243748 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25476 (or 25474 counting only the distinct ones).
The product of its (nonzero) digits is 43008, while the sum is 35.
The square root of 1042243748 is about 32283.8000861113. The cubic root of 1042243748 is about 1013.8874940501.
The spelling of 1042243748 in words is "one billion, forty-two million, two hundred forty-three thousand, seven hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •