Base | Representation |
---|---|
bin | 100110001010100010011… |
… | …1101101110011011001101 |
3 | 200120110001211002222202012 |
4 | 1030111010331232123031 |
5 | 1141414344344200140 |
6 | 15053355122111005 |
7 | 1050650503131113 |
oct | 114250475563315 |
9 | 20513054088665 |
10 | 5245312100045 |
11 | 1742584a32126 |
12 | 7086b04ab465 |
13 | 2c0827b6aa54 |
14 | 141c35739ab3 |
15 | 91698bd3265 |
hex | 4c544f6e6cd |
5245312100045 has 8 divisors (see below), whose sum is σ = 6295028267160. Its totient is φ = 4195813848640.
The previous prime is 5245312100027. The next prime is 5245312100051. The reversal of 5245312100045 is 5400012135425.
It can be written as a sum of positive squares in 4 ways, for example, as 2897151218404 + 2348160881641 = 1702102^2 + 1532371^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5245312100045 - 210 = 5245312099021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5245312099984 and 5245312100020.
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, 54425966 + ... + 54522255.
It is an arithmetic number, because the mean of its divisors is an integer number (786878533395).
Almost surely, 25245312100045 is an apocalyptic number.
It is an amenable number.
5245312100045 is a deficient number, since it is larger than the sum of its proper divisors (1049716167115).
5245312100045 is a wasteful number, since it uses less digits than its factorization.
5245312100045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108957855.
The product of its (nonzero) digits is 24000, while the sum is 32.
The spelling of 5245312100045 in words is "five trillion, two hundred forty-five billion, three hundred twelve million, one hundred thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •