Base | Representation |
---|---|
bin | 1001101011111100110110… |
… | …11100100110010111111000 |
3 | 2210102101111202120000200110 |
4 | 10311332123130212113320 |
5 | 10243000131300132202 |
6 | 113145412213504320 |
7 | 4325654221135434 |
oct | 465763334462770 |
9 | 83371452500613 |
10 | 21301350786552 |
11 | 6872941215151 |
12 | 24804173420a0 |
13 | bb692a1b8555 |
14 | 538dc2d879c4 |
15 | 26e16c67e26c |
hex | 135f9b7265f8 |
21301350786552 has 128 divisors (see below), whose sum is σ = 56127704832000. Its totient is φ = 6718165401600.
The previous prime is 21301350786413. The next prime is 21301350786553. The reversal of 21301350786552 is 25568705310312.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21301350786553) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1479150552 + ... + 1479164952.
It is an arithmetic number, because the mean of its divisors is an integer number (438497694000).
Almost surely, 221301350786552 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21301350786552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28063852416000).
21301350786552 is an abundant number, since it is smaller than the sum of its proper divisors (34826354045448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21301350786552 is a wasteful number, since it uses less digits than its factorization.
21301350786552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18341 (or 18337 counting only the distinct ones).
The product of its (nonzero) digits is 1512000, while the sum is 48.
The spelling of 21301350786552 in words is "twenty-one trillion, three hundred one billion, three hundred fifty million, seven hundred eighty-six thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •