Base | Representation |
---|---|
bin | 1001011011010100… |
… | …00100100010010010 |
3 | 111001201002221120010 |
4 | 10231222010202102 |
5 | 40331102030032 |
6 | 2154110055350 |
7 | 236262353310 |
oct | 45552044222 |
9 | 14051087503 |
10 | 5060970642 |
11 | 2167871172 |
12 | b92aaa556 |
13 | 6286885b0 |
14 | 3602130b0 |
15 | 1e949bccc |
hex | 12da84892 |
5060970642 has 32 divisors (see below), whose sum is σ = 12457775232. Its totient is φ = 1334761344.
The previous prime is 5060970581. The next prime is 5060970643. The reversal of 5060970642 is 2460790605.
It is a super-2 number, since 2×50609706422 = 51226847678371784328, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 5060970642.
It is not an unprimeable number, because it can be changed into a prime (5060970643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4634043 + ... + 4635134.
It is an arithmetic number, because the mean of its divisors is an integer number (389305476).
Almost surely, 25060970642 is an apocalyptic number.
5060970642 is an abundant number, since it is smaller than the sum of its proper divisors (7396804590).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5060970642 is a wasteful number, since it uses less digits than its factorization.
5060970642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9269202.
The product of its (nonzero) digits is 90720, while the sum is 39.
The square root of 5060970642 is about 71140.4993094651. The cubic root of 5060970642 is about 1716.8984399579.
The spelling of 5060970642 in words is "five billion, sixty million, nine hundred seventy thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •