Base | Representation |
---|---|
bin | 1001101101111100111110… |
… | …11001101110110001101110 |
3 | 2210122222001120020102100202 |
4 | 10312332133121232301232 |
5 | 10300112014433321032 |
6 | 113241145532553502 |
7 | 4333640623105352 |
oct | 466763731566156 |
9 | 83588046212322 |
10 | 21370136620142 |
11 | 689a02a005002 |
12 | 2491813622892 |
13 | bc026cc1b62b |
14 | 53c46a623462 |
15 | 270d463a6d62 |
hex | 136f9f66ec6e |
21370136620142 has 4 divisors (see below), whose sum is σ = 32055204930216. Its totient is φ = 10685068310070.
The previous prime is 21370136620109. The next prime is 21370136620163. The reversal of 21370136620142 is 24102663107312.
It is a semiprime because it is the product of two primes.
It is a super-3 number, since 3×213701366201423 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21370136620096 and 21370136620105.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5342534155034 + ... + 5342534155037.
It is an arithmetic number, because the mean of its divisors is an integer number (8013801232554).
Almost surely, 221370136620142 is an apocalyptic number.
21370136620142 is a deficient number, since it is larger than the sum of its proper divisors (10685068310074).
21370136620142 is a wasteful number, since it uses less digits than its factorization.
21370136620142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10685068310073.
The product of its (nonzero) digits is 72576, while the sum is 38.
Adding to 21370136620142 its reverse (24102663107312), we get a palindrome (45472799727454).
The spelling of 21370136620142 in words is "twenty-one trillion, three hundred seventy billion, one hundred thirty-six million, six hundred twenty thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •