Base | Representation |
---|---|
bin | 100101110110110110001… |
… | …0010100100100010010001 |
3 | 200102101220120012122001222 |
4 | 1023231230102210202101 |
5 | 1140221242140444100 |
6 | 15022122502534425 |
7 | 1044622512004523 |
oct | 113555422444221 |
9 | 20371816178058 |
10 | 5203022203025 |
11 | 1726653433609 |
12 | 700469737415 |
13 | 2b984856ca4a |
14 | 13db82dada13 |
15 | 90521173485 |
hex | 4bb6c4a4891 |
5203022203025 has 48 divisors (see below), whose sum is σ = 6721253562240. Its totient is φ = 3990616627200.
The previous prime is 5203022203021. The next prime is 5203022203031.
5203022203025 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 5203022203025 - 22 = 5203022203021 is a prime.
It is a super-2 number, since 2×52030222030252 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5203022202985 and 5203022203003.
It is not an unprimeable number, because it can be changed into a prime (5203022203021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 117541697 + ... + 117585953.
It is an arithmetic number, because the mean of its divisors is an integer number (140026115880).
Almost surely, 25203022203025 is an apocalyptic number.
It is an amenable number.
5203022203025 is a deficient number, since it is larger than the sum of its proper divisors (1518231359215).
5203022203025 is a wasteful number, since it uses less digits than its factorization.
5203022203025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45434 (or 45429 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 26.
The spelling of 5203022203025 in words is "five trillion, two hundred three billion, twenty-two million, two hundred three thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •