Base | Representation |
---|---|
bin | 10000010011000101110110… |
… | …010111010000010110111110 |
3 | 100101210121101212210112021201 |
4 | 100103011312113100112332 |
5 | 33343404030410321000 |
6 | 412241353502250114 |
7 | 21045521305353100 |
oct | 2023056627202676 |
9 | 311717355715251 |
10 | 71680695010750 |
11 | 20926680692541 |
12 | 805824788693a |
13 | 30cc5caa47cc7 |
14 | 139b515327570 |
15 | 8448a55d296a |
hex | 4131765d05be |
71680695010750 has 48 divisors (see below), whose sum is σ = 156094222076208. Its totient is φ = 24576238285200.
The previous prime is 71680695010627. The next prime is 71680695010777. The reversal of 71680695010750 is 5701059608617.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 71680695010691 and 71680695010700.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2925730404 + ... + 2925754903.
It is an arithmetic number, because the mean of its divisors is an integer number (3251962959921).
Almost surely, 271680695010750 is an apocalyptic number.
71680695010750 is a gapful number since it is divisible by the number (70) formed by its first and last digit.
71680695010750 is an abundant number, since it is smaller than the sum of its proper divisors (84413527065458).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
71680695010750 is a wasteful number, since it uses less digits than its factorization.
71680695010750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5851485338 (or 5851485321 counting only the distinct ones).
The product of its (nonzero) digits is 3175200, while the sum is 55.
The spelling of 71680695010750 in words is "seventy-one trillion, six hundred eighty billion, six hundred ninety-five million, ten thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.200 sec. • engine limits •