Base | Representation |
---|---|
bin | 1001011011010101… |
… | …00101011110100010 |
3 | 111001201100210122110 |
4 | 10231222211132202 |
5 | 40331120334240 |
6 | 2154113020150 |
7 | 236263454553 |
oct | 45552453642 |
9 | 14051323573 |
10 | 5061105570 |
11 | 2167953584 |
12 | b92b54656 |
13 | 628704b31 |
14 | 36024a32a |
15 | 1e94c6c80 |
hex | 12daa57a2 |
5061105570 has 32 divisors (see below), whose sum is σ = 12538483200. Its totient is φ = 1306091520.
The previous prime is 5061105493. The next prime is 5061105571. The reversal of 5061105570 is 755011605.
It is a super-2 number, since 2×50611055702 = 51229579181370049800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (5061105571) 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, 2720095 + ... + 2721954.
It is an arithmetic number, because the mean of its divisors is an integer number (391827600).
Almost surely, 25061105570 is an apocalyptic number.
5061105570 is an abundant number, since it is smaller than the sum of its proper divisors (7477377630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5061105570 is a wasteful number, since it uses less digits than its factorization.
5061105570 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5442090.
The product of its (nonzero) digits is 5250, while the sum is 30.
The square root of 5061105570 is about 71141.4476237306. The cubic root of 5061105570 is about 1716.9136976117.
The spelling of 5061105570 in words is "five billion, sixty-one million, one hundred five thousand, five hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •