Base | Representation |
---|---|
bin | 11101111000011011010111… |
… | …010101010011101101101111 |
3 | 122020022201121222121211221220 |
4 | 131320123113111103231233 |
5 | 114211200223113311343 |
6 | 1143301552315154423 |
7 | 36452566303410201 |
oct | 3570332725235557 |
9 | 566281558554856 |
10 | 131421022010223 |
11 | 38969384870990 |
12 | 128a6336445a13 |
13 | 5843c4550c25a |
14 | 2464b506ca771 |
15 | 102d868052183 |
hex | 7786d7553b6f |
131421022010223 has 8 divisors (see below), whose sum is σ = 191157850196736. Its totient is φ = 79649104248600.
The previous prime is 131421022010171. The next prime is 131421022010269. The reversal of 131421022010223 is 322010220124131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131421022010223 - 213 = 131421022002031 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131421022010193 and 131421022010202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131421022010423) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1991227606183 + ... + 1991227606248.
It is an arithmetic number, because the mean of its divisors is an integer number (23894731274592).
Almost surely, 2131421022010223 is an apocalyptic number.
131421022010223 is a deficient number, since it is larger than the sum of its proper divisors (59736828186513).
131421022010223 is a wasteful number, since it uses less digits than its factorization.
131421022010223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3982455212445.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 131421022010223 its reverse (322010220124131), we get a palindrome (453431242134354).
The spelling of 131421022010223 in words is "one hundred thirty-one trillion, four hundred twenty-one billion, twenty-two million, ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •