Base | Representation |
---|---|
bin | 1001101011111100101010… |
… | …1011001101100111111101 |
3 | 1101201012010022112210021012 |
4 | 2122333022223031213331 |
5 | 2343444434302034123 |
6 | 34352455040445005 |
7 | 2146324253264045 |
oct | 232771253154775 |
9 | 41635108483235 |
10 | 10650624252413 |
11 | 34369a4802752 |
12 | 12401b4619765 |
13 | 5c3470c93172 |
14 | 28b6c89a0725 |
15 | 1370a9364378 |
hex | 9afcaacd9fd |
10650624252413 has 4 divisors (see below), whose sum is σ = 10651822711200. Its totient is φ = 10649425793628.
The previous prime is 10650624252311. The next prime is 10650624252461. The reversal of 10650624252413 is 31425242605601.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10650624252413 - 214 = 10650624236029 is a prime.
It is a super-2 number, since 2×106506242524132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10650624252913) 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, 599216063 + ... + 599233836.
It is an arithmetic number, because the mean of its divisors is an integer number (2662955677800).
Almost surely, 210650624252413 is an apocalyptic number.
It is an amenable number.
10650624252413 is a deficient number, since it is larger than the sum of its proper divisors (1198458787).
10650624252413 is an equidigital number, since it uses as much as digits as its factorization.
10650624252413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1198458786.
The product of its (nonzero) digits is 345600, while the sum is 41.
The spelling of 10650624252413 in words is "ten trillion, six hundred fifty billion, six hundred twenty-four million, two hundred fifty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •