Base | Representation |
---|---|
bin | 1001100110010010010010… |
… | …0100110001011010000001 |
3 | 1101100220000222121122121211 |
4 | 2121210210210301122001 |
5 | 2340401224123444401 |
6 | 34240050302450121 |
7 | 2136311544114001 |
oct | 231444444613201 |
9 | 41326028548554 |
10 | 10553348265601 |
11 | 33a9716a75019 |
12 | 1225386b93941 |
13 | 5b723a92715b |
14 | 286adb624001 |
15 | 1347b4354951 |
hex | 99924931681 |
10553348265601 has 8 divisors (see below), whose sum is σ = 10663986778560. Its totient is φ = 10442932143408.
The previous prime is 10553348265533. The next prime is 10553348265617. The reversal of 10553348265601 is 10656284335501.
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 10553348265601 - 225 = 10553314711169 is a prime.
It is a super-2 number, since 2×105533482656012 (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 (10553348265001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55502286 + ... + 55692103.
It is an arithmetic number, because the mean of its divisors is an integer number (1332998347320).
Almost surely, 210553348265601 is an apocalyptic number.
It is an amenable number.
10553348265601 is a deficient number, since it is larger than the sum of its proper divisors (110638512959).
10553348265601 is a wasteful number, since it uses less digits than its factorization.
10553348265601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111195383.
The product of its (nonzero) digits is 2592000, while the sum is 49.
The spelling of 10553348265601 in words is "ten trillion, five hundred fifty-three billion, three hundred forty-eight million, two hundred sixty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •