Base | Representation |
---|---|
bin | 100100110110101011100… |
… | …0011110001111000100100 |
3 | 122221020020101022121111120 |
4 | 1021231113003301320210 |
5 | 1130442041111104112 |
6 | 14434533322333540 |
7 | 1031644022354205 |
oct | 111552703617044 |
9 | 18836211277446 |
10 | 5065227050532 |
11 | 168317268aaa0 |
12 | 69981235a2b0 |
13 | 2a985871895c |
14 | 1372305215ac |
15 | 8bb58cc9e8c |
hex | 49b570f1e24 |
5065227050532 has 96 divisors (see below), whose sum is σ = 13064144486400. Its totient is φ = 1514602003200.
The previous prime is 5065227050491. The next prime is 5065227050539. The reversal of 5065227050532 is 2350507225605.
It is a super-2 number, since 2×50652270505322 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5065227050539) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17805469 + ... + 18087707.
It is an arithmetic number, because the mean of its divisors is an integer number (136084838400).
Almost surely, 25065227050532 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5065227050532, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6532072243200).
5065227050532 is an abundant number, since it is smaller than the sum of its proper divisors (7998917435868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5065227050532 is a wasteful number, since it uses less digits than its factorization.
5065227050532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 284057 (or 284055 counting only the distinct ones).
The product of its (nonzero) digits is 630000, while the sum is 42.
The spelling of 5065227050532 in words is "five trillion, sixty-five billion, two hundred twenty-seven million, fifty thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •