Base | Representation |
---|---|
bin | 1001101110000110010001… |
… | …00101101010100011101100 |
3 | 2210200102221001012111212010 |
4 | 10313003020211222203230 |
5 | 10300202222340103430 |
6 | 113243332403241220 |
7 | 4334205315063504 |
oct | 467031045524354 |
9 | 83612831174763 |
10 | 21375122581740 |
11 | 68a11584a3824 |
12 | 2492785379210 |
13 | bc0885ba3475 |
14 | 53c7c08aca04 |
15 | 271038e88cb0 |
hex | 1370c896a8ec |
21375122581740 has 48 divisors (see below), whose sum is σ = 60670210956768. Its totient is φ = 5621950047744.
The previous prime is 21375122581727. The next prime is 21375122581763. The reversal of 21375122581740 is 4718522157312.
It is a super-2 number, since 2×213751225817402 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21375122581740.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2440078107 + ... + 2440086866.
It is an arithmetic number, because the mean of its divisors is an integer number (1263962728266).
Almost surely, 221375122581740 is an apocalyptic number.
21375122581740 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21375122581740 is an abundant number, since it is smaller than the sum of its proper divisors (39295088375028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21375122581740 is a wasteful number, since it uses less digits than its factorization.
21375122581740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4880165058 (or 4880165056 counting only the distinct ones).
The product of its (nonzero) digits is 940800, while the sum is 48.
The spelling of 21375122581740 in words is "twenty-one trillion, three hundred seventy-five billion, one hundred twenty-two million, five hundred eighty-one thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •