Base | Representation |
---|---|
bin | 100101010111011000101… |
… | …1010100111100100001101 |
3 | 200011221112012122021121111 |
4 | 1022232301122213210031 |
5 | 1133114411342320012 |
6 | 14531110543132021 |
7 | 1040011355463613 |
oct | 112566132474415 |
9 | 20157465567544 |
10 | 5135462463757 |
11 | 16aaa3475254a |
12 | 6ab353ba4011 |
13 | 2b336c869472 |
14 | 13a7b44d76b3 |
15 | 8d8b9ddcba7 |
hex | 4abb16a790d |
5135462463757 has 4 divisors (see below), whose sum is σ = 5135468186556. Its totient is φ = 5135456740960.
The previous prime is 5135462463749. The next prime is 5135462463851. The reversal of 5135462463757 is 7573642645315.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 3501580305001 + 1633882158756 = 1871251^2 + 1278234^2 .
It is a cyclic number.
It is not a de Polignac number, because 5135462463757 - 23 = 5135462463749 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5135462863757) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1189858 + ... + 3418579.
It is an arithmetic number, because the mean of its divisors is an integer number (1283867046639).
Almost surely, 25135462463757 is an apocalyptic number.
It is an amenable number.
5135462463757 is a deficient number, since it is larger than the sum of its proper divisors (5722799).
5135462463757 is a wasteful number, since it uses less digits than its factorization.
5135462463757 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5722798.
The product of its digits is 63504000, while the sum is 58.
The spelling of 5135462463757 in words is "five trillion, one hundred thirty-five billion, four hundred sixty-two million, four hundred sixty-three thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •