Base | Representation |
---|---|
bin | 10010101110001101… |
… | …011111011110001111 |
3 | 1220212222122222222200 |
4 | 102232031133132033 |
5 | 312132234012201 |
6 | 13122433212543 |
7 | 1311106430256 |
oct | 225615373617 |
9 | 56788588880 |
10 | 20102641551 |
11 | 8586465153 |
12 | 3a90401153 |
13 | 1b84a34895 |
14 | d89ba379d |
15 | 7c9c93386 |
hex | 4ae35f78f |
20102641551 has 12 divisors (see below), whose sum is σ = 29038378200. Its totient is φ = 13401193680.
The previous prime is 20102641511. The next prime is 20102641577. The reversal of 20102641551 is 15514620102.
20102641551 is a `hidden beast` number, since 2 + 0 + 10 + 2 + 641 + 5 + 5 + 1 = 666.
It is not a de Polignac number, because 20102641551 - 213 = 20102633359 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20102641511) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 389236 + ... + 437846.
It is an arithmetic number, because the mean of its divisors is an integer number (2419864850).
Almost surely, 220102641551 is an apocalyptic number.
20102641551 is a deficient number, since it is larger than the sum of its proper divisors (8935736649).
20102641551 is a wasteful number, since it uses less digits than its factorization.
20102641551 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94566 (or 94563 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
The spelling of 20102641551 in words is "twenty billion, one hundred two million, six hundred forty-one thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •