Base | Representation |
---|---|
bin | 1001001100001110011111… |
… | …1110111000011010110111 |
3 | 1022210002110110221111102101 |
4 | 2103003213332320122313 |
5 | 2311032340201213421 |
6 | 33254250204322531 |
7 | 2062052361031123 |
oct | 223034776703267 |
9 | 38702413844371 |
10 | 10105655101111 |
11 | 324686993a2a9 |
12 | 1172663543447 |
13 | 583c6144562b |
14 | 26d18b25c583 |
15 | 127d10888191 |
hex | 930e7fb86b7 |
10105655101111 has 4 divisors (see below), whose sum is σ = 10637531685400. Its totient is φ = 9573778516824.
The previous prime is 10105655101103. The next prime is 10105655101123. The reversal of 10105655101111 is 11110155650101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10105655101111 - 23 = 10105655101103 is a prime.
It is a super-2 number, since 2×101056551011112 (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 10105655101111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10105655101511) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 265938292116 + ... + 265938292153.
It is an arithmetic number, because the mean of its divisors is an integer number (2659382921350).
Almost surely, 210105655101111 is an apocalyptic number.
10105655101111 is a deficient number, since it is larger than the sum of its proper divisors (531876584289).
10105655101111 is an equidigital number, since it uses as much as digits as its factorization.
10105655101111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 531876584288.
The product of its (nonzero) digits is 750, while the sum is 28.
The spelling of 10105655101111 in words is "ten trillion, one hundred five billion, six hundred fifty-five million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •