Base | Representation |
---|---|
bin | 1001100110010110010111… |
… | …0101010111100101011011 |
3 | 1101100222212021210210112021 |
4 | 2121211211311113211123 |
5 | 2340410444420312243 |
6 | 34240351053355311 |
7 | 2136350640262003 |
oct | 231454565274533 |
9 | 41328767723467 |
10 | 10554443135323 |
11 | 33aa128aa592a |
12 | 1225631798b37 |
13 | 5b73836cc969 |
14 | 286ba2bc9003 |
15 | 13482a5256ed |
hex | 99965d5795b |
10554443135323 has 8 divisors (see below), whose sum is σ = 10602237381008. Its totient is φ = 10506718613664.
The previous prime is 10554443135311. The next prime is 10554443135329. The reversal of 10554443135323 is 32353134445501.
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 10554443135323 - 213 = 10554443127131 is a prime.
It is a super-2 number, since 2×105544431353232 (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 10554443135323.
It is not an unprimeable number, because it can be changed into a prime (10554443135329) 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, 17127561 + ... + 17733082.
It is an arithmetic number, because the mean of its divisors is an integer number (1325279672626).
Almost surely, 210554443135323 is an apocalyptic number.
10554443135323 is a deficient number, since it is larger than the sum of its proper divisors (47794245685).
10554443135323 is a wasteful number, since it uses less digits than its factorization.
10554443135323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34862013.
The product of its (nonzero) digits is 1296000, while the sum is 43.
The spelling of 10554443135323 in words is "ten trillion, five hundred fifty-four billion, four hundred forty-three million, one hundred thirty-five thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •