Base | Representation |
---|---|
bin | 1001011011011110… |
… | …11100000010101010 |
3 | 111001210202102121020 |
4 | 10231233130002222 |
5 | 40331432041032 |
6 | 2154200153310 |
7 | 236310333330 |
oct | 45557340252 |
9 | 14053672536 |
10 | 5062377642 |
11 | 2168642283 |
12 | b93468836 |
13 | 628a5bb3a |
14 | 36049bb50 |
15 | 1e9678b2c |
hex | 12dbdc0aa |
5062377642 has 32 divisors (see below), whose sum is σ = 11589962112. Its totient is φ = 1444041984.
The previous prime is 5062377641. The next prime is 5062377653. The reversal of 5062377642 is 2467732605.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 5062377594 and 5062377603.
It is not an unprimeable number, because it can be changed into a prime (5062377641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 71763 + ... + 123590.
It is an arithmetic number, because the mean of its divisors is an integer number (362186316).
Almost surely, 25062377642 is an apocalyptic number.
5062377642 is an abundant number, since it is smaller than the sum of its proper divisors (6527584470).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5062377642 is a wasteful number, since it uses less digits than its factorization.
5062377642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195982.
The product of its (nonzero) digits is 423360, while the sum is 42.
The square root of 5062377642 is about 71150.3875042153. The cubic root of 5062377642 is about 1717.0575301437.
The spelling of 5062377642 in words is "five billion, sixty-two million, three hundred seventy-seven thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •