Base | Representation |
---|---|
bin | 100100100111110100011… |
… | …0101101110110011000101 |
3 | 122211011212020121002202111 |
4 | 1021033220311232303011 |
5 | 1124431211123244140 |
6 | 14412134435541021 |
7 | 1026434122315423 |
oct | 111175065566305 |
9 | 18734766532674 |
10 | 5033313103045 |
11 | 1670686034987 |
12 | 6935a645a771 |
13 | 2a6840978766 |
14 | 135883c1c113 |
15 | 8addc13a7ea |
hex | 493e8d6ecc5 |
5033313103045 has 8 divisors (see below), whose sum is σ = 6054743392920. Its totient is φ = 4016805369600.
The previous prime is 5033313103009. The next prime is 5033313103073. The reversal of 5033313103045 is 5403013133305.
It can be written as a sum of positive squares in 4 ways, for example, as 1166084661316 + 3867228441729 = 1079854^2 + 1966527^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5033313103045 - 221 = 5033311005893 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5033313102998 and 5033313103016.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1230636856 + ... + 1230640945.
It is an arithmetic number, because the mean of its divisors is an integer number (756842924115).
Almost surely, 25033313103045 is an apocalyptic number.
It is an amenable number.
5033313103045 is a deficient number, since it is larger than the sum of its proper divisors (1021430289875).
5033313103045 is a wasteful number, since it uses less digits than its factorization.
5033313103045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2461278215.
The product of its (nonzero) digits is 24300, while the sum is 31.
The spelling of 5033313103045 in words is "five trillion, thirty-three billion, three hundred thirteen million, one hundred three thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •