Base | Representation |
---|---|
bin | 1110101010100110111101… |
… | …0100010010111111111100 |
3 | 2010002112220011021112220220 |
4 | 3222221233110102333330 |
5 | 4103143324223231420 |
6 | 54143445242541340 |
7 | 3253001602313250 |
oct | 352515724227774 |
9 | 63075804245826 |
10 | 16125174820860 |
11 | 5157714893046 |
12 | 1985200507850 |
13 | 8cc79c810951 |
14 | 3da669632260 |
15 | 1ce6bd31b840 |
hex | eaa6f512ffc |
16125174820860 has 48 divisors (see below), whose sum is σ = 51600559428096. Its totient is φ = 3685754244672.
The previous prime is 16125174820841. The next prime is 16125174820861. The reversal of 16125174820860 is 6802847152161.
It is a happy number.
It is a super-2 number, since 2×161251748208602 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16125174820861) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19196636272 + ... + 19196637111.
It is an arithmetic number, because the mean of its divisors is an integer number (1075011654752).
Almost surely, 216125174820860 is an apocalyptic number.
16125174820860 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
16125174820860 is an abundant number, since it is smaller than the sum of its proper divisors (35475384607236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16125174820860 is a wasteful number, since it uses less digits than its factorization.
16125174820860 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38393273402 (or 38393273400 counting only the distinct ones).
The product of its (nonzero) digits is 1290240, while the sum is 51.
The spelling of 16125174820860 in words is "sixteen trillion, one hundred twenty-five billion, one hundred seventy-four million, eight hundred twenty thousand, eight hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •