Base | Representation |
---|---|
bin | 101111100011101111… |
… | …1101001011111101111 |
3 | 100202121200220001001200 |
4 | 1133013133221133233 |
5 | 3133131042211343 |
6 | 114530214140543 |
7 | 10243622651250 |
oct | 1370737513757 |
9 | 322550801050 |
10 | 102131210223 |
11 | 3a34a450969 |
12 | 17963651753 |
13 | 9828207393 |
14 | 4d2c112b27 |
15 | 29cb3b94d3 |
hex | 17c77e97ef |
102131210223 has 48 divisors (see below), whose sum is σ = 180682784256. Its totient is φ = 54314504640.
The previous prime is 102131210219. The next prime is 102131210249. The reversal of 102131210223 is 322012131201.
102131210223 is a `hidden beast` number, since 102 + 131 + 210 + 223 = 666.
It is not a de Polignac number, because 102131210223 - 22 = 102131210219 is a prime.
It is a super-2 number, since 2×1021312102232 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102131210196 and 102131210205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102131210273) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 898873 + ... + 1006098.
It is an arithmetic number, because the mean of its divisors is an integer number (3764224672).
Almost surely, 2102131210223 is an apocalyptic number.
102131210223 is a deficient number, since it is larger than the sum of its proper divisors (78551574033).
102131210223 is a wasteful number, since it uses less digits than its factorization.
102131210223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1905044 (or 1905041 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 102131210223 its reverse (322012131201), we get a palindrome (424143341424).
The spelling of 102131210223 in words is "one hundred two billion, one hundred thirty-one million, two hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •