Base | Representation |
---|---|
bin | 1110101011101010001010… |
… | …0111011111100000111100 |
3 | 2010011021110102201220021102 |
4 | 3222322202213133200330 |
5 | 4103442301113010220 |
6 | 54200031334152232 |
7 | 3254210632340405 |
oct | 352724247374074 |
9 | 63137412656242 |
10 | 16143215360060 |
11 | 5164332244178 |
12 | 19887b61b2678 |
13 | 9013b6266309 |
14 | 3db49b5b29ac |
15 | 1cedc7031775 |
hex | eaea29df83c |
16143215360060 has 24 divisors (see below), whose sum is σ = 33912232485936. Its totient is φ = 6455099433600.
The previous prime is 16143215360059. The next prime is 16143215360087. The reversal of 16143215360060 is 6006351234161.
It is a super-2 number, since 2×161432153600602 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 16143215359996 and 16143215360023.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 136608866 + ... + 136726985.
It is an arithmetic number, because the mean of its divisors is an integer number (1413009686914).
Almost surely, 216143215360060 is an apocalyptic number.
16143215360060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
16143215360060 is an abundant number, since it is smaller than the sum of its proper divisors (17769017125876).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16143215360060 is a wasteful number, since it uses less digits than its factorization.
16143215360060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273338813 (or 273338811 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 38.
The spelling of 16143215360060 in words is "sixteen trillion, one hundred forty-three billion, two hundred fifteen million, three hundred sixty thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •