Base | Representation |
---|---|
bin | 1001100011010111101000… |
… | …0010000100001010001111 |
3 | 1101012002201000120222020120 |
4 | 2120311322002010022033 |
5 | 2334041120023303044 |
6 | 34201042320120023 |
7 | 2132556065230230 |
oct | 230657202041217 |
9 | 41162630528216 |
10 | 10503242400399 |
11 | 338a444574971 |
12 | 1217722766013 |
13 | 5b25b3c6c0c8 |
14 | 284506c17087 |
15 | 13333054c519 |
hex | 98d7a08428f |
10503242400399 has 16 divisors (see below), whose sum is σ = 16437506769408. Its totient is φ = 5839640561952.
The previous prime is 10503242400377. The next prime is 10503242400407. The reversal of 10503242400399 is 99300424230501.
It is not a de Polignac number, because 10503242400399 - 27 = 10503242400271 is a prime.
It is a super-2 number, since 2×105032424003992 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10503242400399.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10503242400359) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6758842467 + ... + 6758844020.
It is an arithmetic number, because the mean of its divisors is an integer number (1027344173088).
Almost surely, 210503242400399 is an apocalyptic number.
10503242400399 is a deficient number, since it is larger than the sum of its proper divisors (5934264369009).
10503242400399 is a wasteful number, since it uses less digits than its factorization.
10503242400399 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13517686534.
The product of its (nonzero) digits is 233280, while the sum is 42.
The spelling of 10503242400399 in words is "ten trillion, five hundred three billion, two hundred forty-two million, four hundred thousand, three hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •