Base | Representation |
---|---|
bin | 1001001100010000001011… |
… | …0101001111111111100101 |
3 | 1022210010121212120020022020 |
4 | 2103010002311033333211 |
5 | 2311034301010423221 |
6 | 33254403015253353 |
7 | 2062066500624336 |
oct | 223040265177745 |
9 | 38703555506266 |
10 | 10106105561061 |
11 | 3246a8013a554 |
12 | 117276a37a259 |
13 | 584003873793 |
14 | 26d1d0dda28d |
15 | 127d3a1b7ac6 |
hex | 93102d4ffe5 |
10106105561061 has 8 divisors (see below), whose sum is σ = 13491061709280. Its totient is φ = 6729276560112.
The previous prime is 10106105561029. The next prime is 10106105561063. The reversal of 10106105561061 is 16016550160101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10106105561061 - 25 = 10106105561029 is a prime.
It is a super-2 number, since 2×101061055610612 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10106105561063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2031783915 + ... + 2031788888.
It is an arithmetic number, because the mean of its divisors is an integer number (1686382713660).
Almost surely, 210106105561061 is an apocalyptic number.
It is an amenable number.
10106105561061 is a deficient number, since it is larger than the sum of its proper divisors (3384956148219).
10106105561061 is an equidigital number, since it uses as much as digits as its factorization.
10106105561061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4063573635.
The product of its (nonzero) digits is 5400, while the sum is 33.
The spelling of 10106105561061 in words is "ten trillion, one hundred six billion, one hundred five million, five hundred sixty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •