Base | Representation |
---|---|
bin | 101111100110101100… |
… | …0111010111110011001 |
3 | 100202212120222200012021 |
4 | 1133031120322332121 |
5 | 3133331402010410 |
6 | 114544110014441 |
7 | 10246233412144 |
oct | 1371530727631 |
9 | 322776880167 |
10 | 102230110105 |
11 | 3a3a0260902 |
12 | 179907a7421 |
13 | 9842854216 |
14 | 4d3b2d905b |
15 | 29d4e02eda |
hex | 17cd63af99 |
102230110105 has 8 divisors (see below), whose sum is σ = 122678232264. Its totient is φ = 81782688000.
The previous prime is 102230110057. The next prime is 102230110127. The reversal of 102230110105 is 501011032201.
It can be written as a sum of positive squares in 4 ways, for example, as 14040117081 + 88189993024 = 118491^2 + 296968^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-102230110105 is a prime.
It is a super-2 number, since 2×1022301101052 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
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, 232545 + ... + 508465.
It is an arithmetic number, because the mean of its divisors is an integer number (15334779033).
Almost surely, 2102230110105 is an apocalyptic number.
It is an amenable number.
102230110105 is a deficient number, since it is larger than the sum of its proper divisors (20448122159).
102230110105 is an equidigital number, since it uses as much as digits as its factorization.
102230110105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 350027.
The product of its (nonzero) digits is 60, while the sum is 16.
Adding to 102230110105 its reverse (501011032201), we get a palindrome (603241142306).
The spelling of 102230110105 in words is "one hundred two billion, two hundred thirty million, one hundred ten thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •