Base | Representation |
---|---|
bin | 1001000101001101010100… |
… | …11100101110000100101100 |
3 | 2121201010110222011021112120 |
4 | 10202212222130232010230 |
5 | 10104142343112131242 |
6 | 110250055511232540 |
7 | 4130540150311662 |
oct | 442465234560454 |
9 | 77633428137476 |
10 | 19970162614572 |
11 | 63aa3311a1815 |
12 | 22a6427078750 |
13 | b1b2418164a1 |
14 | 4d07bd662c32 |
15 | 24970a67e1ec |
hex | 1229aa72e12c |
19970162614572 has 96 divisors (see below), whose sum is σ = 51490041265152. Its totient is φ = 5991952766976.
The previous prime is 19970162614553. The next prime is 19970162614583. The reversal of 19970162614572 is 27541626107991.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 35412288 + ... + 35971800.
It is an arithmetic number, because the mean of its divisors is an integer number (536354596512).
Almost surely, 219970162614572 is an apocalyptic number.
19970162614572 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 19970162614572, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25745020632576).
19970162614572 is an abundant number, since it is smaller than the sum of its proper divisors (31519878650580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19970162614572 is a wasteful number, since it uses less digits than its factorization.
19970162614572 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 567167 (or 567165 counting only the distinct ones).
The product of its (nonzero) digits is 11430720, while the sum is 60.
The spelling of 19970162614572 in words is "nineteen trillion, nine hundred seventy billion, one hundred sixty-two million, six hundred fourteen thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •