Base | Representation |
---|---|
bin | 111011110000011… |
… | …001010000111110 |
3 | 2120212110102021110 |
4 | 323300121100332 |
5 | 4023122322032 |
6 | 243251542450 |
7 | 33562316250 |
oct | 7360312076 |
9 | 2525412243 |
10 | 1002542142 |
11 | 4749aa828 |
12 | 23b8baa26 |
13 | 12c91a304 |
14 | 9720dcd0 |
15 | 5d0347cc |
hex | 3bc1943e |
1002542142 has 64 divisors (see below), whose sum is σ = 2347559424. Its totient is φ = 279521280.
The previous prime is 1002542141. The next prime is 1002542221. The reversal of 1002542142 is 2412452001.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1002542141) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 295717 + ... + 299087.
It is an arithmetic number, because the mean of its divisors is an integer number (36680616).
Almost surely, 21002542142 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1002542142, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1173779712).
1002542142 is an abundant number, since it is smaller than the sum of its proper divisors (1345017282).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1002542142 is a wasteful number, since it uses less digits than its factorization.
1002542142 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3553.
The product of its (nonzero) digits is 640, while the sum is 21.
The square root of 1002542142 is about 31662.9458831613. The cubic root of 1002542142 is about 1000.8466636251.
Adding to 1002542142 its reverse (2412452001), we get a palindrome (3414994143).
The spelling of 1002542142 in words is "one billion, two million, five hundred forty-two thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •