Base | Representation |
---|---|
bin | 1001010100110001100101… |
… | …0101101000100010101111 |
3 | 1100022010112012011210221111 |
4 | 2111030121111220202233 |
5 | 2320434121040141124 |
6 | 33445534454212451 |
7 | 2105501543265226 |
oct | 225143125504257 |
9 | 40263465153844 |
10 | 10252512037039 |
11 | 32a307a842938 |
12 | 1197009654127 |
13 | 594a6679c65c |
14 | 27631d405cbd |
15 | 12ba58564494 |
hex | 953195688af |
10252512037039 has 8 divisors (see below), whose sum is σ = 10469372251520. Its totient is φ = 10037529400536.
The previous prime is 10252512037037. The next prime is 10252512037057. The reversal of 10252512037039 is 93073021525201.
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 10252512037039 - 21 = 10252512037037 is a prime.
It is a super-2 number, since 2×102525120370392 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10252512036992 and 10252512037010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10252512037037) 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, 469383459 + ... + 469405300.
It is an arithmetic number, because the mean of its divisors is an integer number (1308671531440).
Almost surely, 210252512037039 is an apocalyptic number.
10252512037039 is a deficient number, since it is larger than the sum of its proper divisors (216860214481).
10252512037039 is an equidigital number, since it uses as much as digits as its factorization.
10252512037039 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 938788989.
The product of its (nonzero) digits is 113400, while the sum is 40.
The spelling of 10252512037039 in words is "ten trillion, two hundred fifty-two billion, five hundred twelve million, thirty-seven thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •