Base | Representation |
---|---|
bin | 100101001010101111010… |
… | …0010111010010101001001 |
3 | 200002100102101001021120211 |
4 | 1022111132202322111021 |
5 | 1132143300343400230 |
6 | 14510415515121121 |
7 | 1035030331223032 |
oct | 112253642722511 |
9 | 20070371037524 |
10 | 5108302325065 |
11 | 169a467542335 |
12 | 6a60341431a1 |
13 | 2b0931949c94 |
14 | 1393592cba89 |
15 | 8cd2a77442a |
hex | 4a55e8ba549 |
5108302325065 has 4 divisors (see below), whose sum is σ = 6129962790084. Its totient is φ = 4086641860048.
The previous prime is 5108302325051. The next prime is 5108302325081. The reversal of 5108302325065 is 5605232038015.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3627573535161 + 1480728789904 = 1904619^2 + 1216852^2 .
It is a cyclic number.
It is not a de Polignac number, because 5108302325065 - 233 = 5099712390473 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 510830232502 + ... + 510830232511.
It is an arithmetic number, because the mean of its divisors is an integer number (1532490697521).
Almost surely, 25108302325065 is an apocalyptic number.
It is an amenable number.
5108302325065 is a deficient number, since it is larger than the sum of its proper divisors (1021660465019).
5108302325065 is a wasteful number, since it uses less digits than its factorization.
5108302325065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1021660465018.
The product of its (nonzero) digits is 216000, while the sum is 40.
The spelling of 5108302325065 in words is "five trillion, one hundred eight billion, three hundred two million, three hundred twenty-five thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •