Base | Representation |
---|---|
bin | 100100110101010010100… |
… | …1000111010010111001011 |
3 | 122220221112100111221200000 |
4 | 1021222211020322113023 |
5 | 1130414432431122111 |
6 | 14433321211414043 |
7 | 1031510035320210 |
oct | 111524510722713 |
9 | 18827470457600 |
10 | 5062242051531 |
11 | 1681980736075 |
12 | 69911a754323 |
13 | 2a94a1187362 |
14 | 137029d01b07 |
15 | 8ba31beac56 |
hex | 49aa523a5cb |
5062242051531 has 192 divisors, whose sum is σ = 8845137100800. Its totient is φ = 2833799126400.
The previous prime is 5062242051511. The next prime is 5062242051551. The reversal of 5062242051531 is 1351502422605.
5062242051531 is a `hidden beast` number, since 5 + 0 + 622 + 4 + 20 + 5 + 1 + 5 + 3 + 1 = 666.
It is an interprime number because it is at equal distance from previous prime (5062242051511) and next prime (5062242051551).
It is not a de Polignac number, because 5062242051531 - 27 = 5062242051403 is a prime.
It is a super-2 number, since 2×50622420515312 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5062242051511) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 8991548656 + ... + 8991549218.
It is an arithmetic number, because the mean of its divisors is an integer number (46068422400).
Almost surely, 25062242051531 is an apocalyptic number.
5062242051531 is a deficient number, since it is larger than the sum of its proper divisors (3782895049269).
5062242051531 is a wasteful number, since it uses less digits than its factorization.
5062242051531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1148 (or 1136 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 36.
The spelling of 5062242051531 in words is "five trillion, sixty-two billion, two hundred forty-two million, fifty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •