Base | Representation |
---|---|
bin | 1001000110001000110110… |
… | …1010001001010001010001 |
3 | 1022102002111002202021002221 |
4 | 2101202031222021101101 |
5 | 2302324132442004221 |
6 | 33134231311141041 |
7 | 2051360413425544 |
oct | 221421552112121 |
9 | 38362432667087 |
10 | 10001060500561 |
11 | 3206475a1a869 |
12 | 1156332b14781 |
13 | 577132a89450 |
14 | 2680a7d0885b |
15 | 12523d0c5541 |
hex | 9188da89451 |
10001060500561 has 16 divisors (see below), whose sum is σ = 10893943244800. Its totient is φ = 9126216537408.
The previous prime is 10001060500553. The next prime is 10001060500573. The reversal of 10001060500561 is 16500506010001.
It is a cyclic number.
It is not a de Polignac number, because 10001060500561 - 23 = 10001060500553 is a prime.
It is a super-2 number, since 2×100010605005612 (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 (10001060500661) 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, 7416561 + ... + 8660686.
It is an arithmetic number, because the mean of its divisors is an integer number (680871452800).
Almost surely, 210001060500561 is an apocalyptic number.
It is an amenable number.
10001060500561 is a deficient number, since it is larger than the sum of its proper divisors (892882744239).
10001060500561 is a wasteful number, since it uses less digits than its factorization.
10001060500561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16077808.
The product of its (nonzero) digits is 900, while the sum is 25.
Adding to 10001060500561 its reverse (16500506010001), we get a palindrome (26501566510562).
The spelling of 10001060500561 in words is "ten trillion, one billion, sixty million, five hundred thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •