Base | Representation |
---|---|
bin | 1001001001100100110100… |
… | …0001001000101011100001 |
3 | 1022121201220001102120201122 |
4 | 2102121031001020223201 |
5 | 2304311044010104221 |
6 | 33221314303342025 |
7 | 2055550536162503 |
oct | 222311501105341 |
9 | 38551801376648 |
10 | 10060105550561 |
11 | 3229515353850 |
12 | 1165870bb1915 |
13 | 57c882720761 |
14 | 26aca9a19d73 |
15 | 126a46a94eab |
hex | 9264d048ae1 |
10060105550561 has 16 divisors (see below), whose sum is σ = 10979294515200. Its totient is φ = 9141689699280.
The previous prime is 10060105550507. The next prime is 10060105550567. The reversal of 10060105550561 is 16505550106001.
It is a cyclic number.
It is not a de Polignac number, because 10060105550561 - 210 = 10060105549537 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10060105550567) 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 15 ways as a sum of consecutive naturals, for example, 381065840 + ... + 381092238.
It is an arithmetic number, because the mean of its divisors is an integer number (686205907200).
Almost surely, 210060105550561 is an apocalyptic number.
10060105550561 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10060105550561 is a deficient number, since it is larger than the sum of its proper divisors (919188964639).
10060105550561 is a wasteful number, since it uses less digits than its factorization.
10060105550561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39724.
The product of its (nonzero) digits is 22500, while the sum is 35.
Adding to 10060105550561 its reverse (16505550106001), we get a palindrome (26565655656562).
The spelling of 10060105550561 in words is "ten trillion, sixty billion, one hundred five million, five hundred fifty thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.375 sec. • engine limits •