Base | Representation |
---|---|
bin | 1001101010101010001011… |
… | …0011111110100110010111 |
3 | 1101122001222002101222002022 |
4 | 2122222202303332212113 |
5 | 2343114112020000142 |
6 | 34334353454003355 |
7 | 2144611441456505 |
oct | 232524263764627 |
9 | 41561862358068 |
10 | 10628480625047 |
11 | 342857125776a |
12 | 1237a547a655b |
13 | 5c1352463a8c |
14 | 28a5c7b13675 |
15 | 1367103146d2 |
hex | 9aaa2cfe997 |
10628480625047 has 4 divisors (see below), whose sum is σ = 10638204762120. Its totient is φ = 10618756487976.
The previous prime is 10628480625001. The next prime is 10628480625083. The reversal of 10628480625047 is 74052608482601.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10628480625047 - 216 = 10628480559511 is a prime.
It is a super-2 number, since 2×106284806250472 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10628480625047.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10628480625947) 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, 4862066897 + ... + 4862069082.
It is an arithmetic number, because the mean of its divisors is an integer number (2659551190530).
Almost surely, 210628480625047 is an apocalyptic number.
10628480625047 is a deficient number, since it is larger than the sum of its proper divisors (9724137073).
10628480625047 is an equidigital number, since it uses as much as digits as its factorization.
10628480625047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9724137072.
The product of its (nonzero) digits is 5160960, while the sum is 53.
The spelling of 10628480625047 in words is "ten trillion, six hundred twenty-eight billion, four hundred eighty million, six hundred twenty-five thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •