Base | Representation |
---|---|
bin | 1001001001111001111110… |
… | …01011010111001110100100 |
3 | 2122021120002211202100001111 |
4 | 10210330333023113032210 |
5 | 10114313424321102214 |
6 | 110452152155234404 |
7 | 4145313053462302 |
oct | 444747713271644 |
9 | 78246084670044 |
10 | 20131571659684 |
11 | 646182a411371 |
12 | 2311772748a04 |
13 | b3052597a8c4 |
14 | 4d8532361272 |
15 | 24da05b9b5c4 |
hex | 124f3f2d73a4 |
20131571659684 has 27 divisors (see below), whose sum is σ = 36487449193377. Its totient is φ = 9718564135728.
The previous prime is 20131571659649. The next prime is 20131571659709. The reversal of 20131571659684 is 48695617513102.
The square root of 20131571659684 is 4486822.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 10556507850084 + 9575063809600 = 3249078^2 + 3094360^2 .
It is a Harshad number since it is a multiple of its sum of digits (58).
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 260196997 + ... + 260274355.
It is a 1-persistent number, because it is pandigital, but 2⋅20131571659684 = 40263143319368 is not.
Almost surely, 220131571659684 is an apocalyptic number.
20131571659684 is the 4486822-nd square number.
It is an amenable number.
20131571659684 is a deficient number, since it is larger than the sum of its proper divisors (16355877533693).
20131571659684 is an frugal number, since it uses more digits than its factorization.
20131571659684 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154780 (or 77390 counting only the distinct ones).
The product of its (nonzero) digits is 10886400, while the sum is 58.
The spelling of 20131571659684 in words is "twenty trillion, one hundred thirty-one billion, five hundred seventy-one million, six hundred fifty-nine thousand, six hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •