Base | Representation |
---|---|
bin | 100101111011010011111… |
… | …0011100001101111111111 |
3 | 200110022122210112022212002 |
4 | 1023312213303201233333 |
5 | 1140400411310221303 |
6 | 15030350144132515 |
7 | 1045412231215145 |
oct | 113664763415777 |
9 | 20408583468762 |
10 | 5212610632703 |
11 | 172a72389a761 |
12 | 7022a490713b |
13 | 2ba715bc7386 |
14 | 1404125d9595 |
15 | 908d2d34788 |
hex | 4bda7ce1bff |
5212610632703 has 8 divisors (see below), whose sum is σ = 5576908702320. Its totient is φ = 4857307577280.
The previous prime is 5212610632681. The next prime is 5212610632709. The reversal of 5212610632703 is 3072360162125.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5212610632703 - 218 = 5212610370559 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 (5212610632709) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2248752350 + ... + 2248754667.
It is an arithmetic number, because the mean of its divisors is an integer number (697113587790).
Almost surely, 25212610632703 is an apocalyptic number.
5212610632703 is a deficient number, since it is larger than the sum of its proper divisors (364298069617).
5212610632703 is a wasteful number, since it uses less digits than its factorization.
5212610632703 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4497507097.
The product of its (nonzero) digits is 90720, while the sum is 38.
Adding to 5212610632703 its reverse (3072360162125), we get a palindrome (8284970794828).
The spelling of 5212610632703 in words is "five trillion, two hundred twelve billion, six hundred ten million, six hundred thirty-two thousand, seven hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •