Base | Representation |
---|---|
bin | 1001100110011001110010… |
… | …0001000001111010000011 |
3 | 1101101002020020002022121022 |
4 | 2121212130201001322003 |
5 | 2340414334300104111 |
6 | 34241022105020055 |
7 | 2136412450212626 |
oct | 231463441017203 |
9 | 41332206068538 |
10 | 10555360550531 |
11 | 33aa559942515 |
12 | 1225848a8462b |
13 | 5b749b7b30b4 |
14 | 286c4c999dbd |
15 | 134880d422db |
hex | 9999c841e83 |
10555360550531 has 8 divisors (see below), whose sum is σ = 10779992940864. Its totient is φ = 10330730254080.
The previous prime is 10555360550509. The next prime is 10555360550533. The reversal of 10555360550531 is 13505506355501.
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 10555360550531 - 222 = 10555356356227 is a prime.
It is a super-2 number, since 2×105553605505312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10555360550533) 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 7 ways as a sum of consecutive naturals, for example, 13781321 + ... + 14527061.
It is an arithmetic number, because the mean of its divisors is an integer number (1347499117608).
Almost surely, 210555360550531 is an apocalyptic number.
10555360550531 is a deficient number, since it is larger than the sum of its proper divisors (224632390333).
10555360550531 is an equidigital number, since it uses as much as digits as its factorization.
10555360550531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1046941.
The product of its (nonzero) digits is 843750, while the sum is 44.
The spelling of 10555360550531 in words is "ten trillion, five hundred fifty-five billion, three hundred sixty million, five hundred fifty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •