Base | Representation |
---|---|
bin | 100100110110101000001… |
… | …0011000010011100111101 |
3 | 122221012221110212020102001 |
4 | 1021231100103002130331 |
5 | 1130441323041010140 |
6 | 14434514151102301 |
7 | 1031641144213006 |
oct | 111552023023475 |
9 | 18835843766361 |
10 | 5065113610045 |
11 | 1683114649525 |
12 | 6997a0371991 |
13 | 2a983b07a5c8 |
14 | 13721d4321ad |
15 | 8bb4dd6ce9a |
hex | 49b504c273d |
5065113610045 has 8 divisors (see below), whose sum is σ = 6177777911640. Its totient is φ = 3985663168320.
The previous prime is 5065113610043. The next prime is 5065113610061. The reversal of 5065113610045 is 5400163115605.
It can be written as a sum of positive squares in 4 ways, for example, as 217569072249 + 4847544537796 = 466443^2 + 2201714^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5065113610045 - 21 = 5065113610043 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5065113609986 and 5065113610013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5065113610043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8303464630 + ... + 8303465239.
It is an arithmetic number, because the mean of its divisors is an integer number (772222238955).
Almost surely, 25065113610045 is an apocalyptic number.
It is an amenable number.
5065113610045 is a deficient number, since it is larger than the sum of its proper divisors (1112664301595).
5065113610045 is a wasteful number, since it uses less digits than its factorization.
5065113610045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16606929935.
The product of its (nonzero) digits is 54000, while the sum is 37.
The spelling of 5065113610045 in words is "five trillion, sixty-five billion, one hundred thirteen million, six hundred ten thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •