Base | Representation |
---|---|
bin | 111110101011101… |
… | …011101001101010 |
3 | 2201021211202122120 |
4 | 332223223221222 |
5 | 4123204412003 |
6 | 252204132110 |
7 | 35026531050 |
oct | 7653535152 |
9 | 2637752576 |
10 | 1051638378 |
11 | 49a69352a |
12 | 254237036 |
13 | 139b4a23b |
14 | 9d9501d0 |
15 | 624d1853 |
hex | 3eaeba6a |
1051638378 has 16 divisors (see below), whose sum is σ = 2403744960. Its totient is φ = 300468096.
The previous prime is 1051638331. The next prime is 1051638403. The reversal of 1051638378 is 8738361501.
It is a super-2 number, since 2×10516383782 = 2211886556164941768, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42), and also a Moran number because the ratio is a prime number: 25039009 = 1051638378 / (1 + 0 + 5 + 1 + 6 + 3 + 8 + 3 + 7 + 8).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12519463 + ... + 12519546.
It is an arithmetic number, because the mean of its divisors is an integer number (150234060).
Almost surely, 21051638378 is an apocalyptic number.
1051638378 is an abundant number, since it is smaller than the sum of its proper divisors (1352106582).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1051638378 is a wasteful number, since it uses less digits than its factorization.
1051638378 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25039021.
The product of its (nonzero) digits is 120960, while the sum is 42.
The square root of 1051638378 is about 32428.9743593596. The cubic root of 1051638378 is about 1016.9247301656.
Adding to 1051638378 its reverse (8738361501), we get a palindrome (9789999879).
The spelling of 1051638378 in words is "one billion, fifty-one million, six hundred thirty-eight thousand, three hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •