Base | Representation |
---|---|
bin | 100101001100101010000… |
… | …0011101000010101110100 |
3 | 200002202001102122220110201 |
4 | 1022121110003220111310 |
5 | 1132230214324220202 |
6 | 14512340335330244 |
7 | 1035234365133544 |
oct | 112312403502564 |
9 | 20082042586421 |
10 | 5112421320052 |
11 | 16a1190611222 |
12 | 6a69a3680984 |
13 | 2b113a103017 |
14 | 13962a379324 |
15 | 8cebc1a2387 |
hex | 4a6540e8574 |
5112421320052 has 24 divisors (see below), whose sum is σ = 8999557138152. Its totient is φ = 2541122908800.
The previous prime is 5112421320029. The next prime is 5112421320107. The reversal of 5112421320052 is 2500231242115.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 3228044648976 + 1884376671076 = 1796676^2 + 1372726^2 .
It is a super-2 number, since 2×51124213200522 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5112421320052.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5239602 + ... + 6138262.
It is an arithmetic number, because the mean of its divisors is an integer number (374981547423).
Almost surely, 25112421320052 is an apocalyptic number.
It is an amenable number.
5112421320052 is a deficient number, since it is larger than the sum of its proper divisors (3887135818100).
5112421320052 is a wasteful number, since it uses less digits than its factorization.
5112421320052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 907059 (or 907057 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 5112421320052 its reverse (2500231242115), we get a palindrome (7612652562167).
The spelling of 5112421320052 in words is "five trillion, one hundred twelve billion, four hundred twenty-one million, three hundred twenty thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •