Base | Representation |
---|---|
bin | 100101110110000100010… |
… | …0111101101101101101100 |
3 | 200102020121000201010202010 |
4 | 1023230020213231231230 |
5 | 1140204331101232134 |
6 | 15021244530201220 |
7 | 1044533205504246 |
oct | 113541047555554 |
9 | 20366530633663 |
10 | 5201350024044 |
11 | 1725975542809 |
12 | 700081723210 |
13 | 2b963ccb4725 |
14 | 13da64c8b096 |
15 | 90474467ce9 |
hex | 4bb089edb6c |
5201350024044 has 12 divisors (see below), whose sum is σ = 12136483389464. Its totient is φ = 1733783341344.
The previous prime is 5201350024043. The next prime is 5201350024099. The reversal of 5201350024044 is 4404200531025.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×52013500240442 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5201350024043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 216722917657 + ... + 216722917680.
Almost surely, 25201350024044 is an apocalyptic number.
It is an amenable number.
5201350024044 is an abundant number, since it is smaller than the sum of its proper divisors (6935133365420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5201350024044 is a wasteful number, since it uses less digits than its factorization.
5201350024044 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 433445835344 (or 433445835342 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 30.
Adding to 5201350024044 its reverse (4404200531025), we get a palindrome (9605550555069).
The spelling of 5201350024044 in words is "five trillion, two hundred one billion, three hundred fifty million, twenty-four thousand, forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •