Base | Representation |
---|---|
bin | 10001100010110… |
… | …10100101110000 |
3 | 101020221002121120 |
4 | 20301122211300 |
5 | 300133443241 |
6 | 22334222240 |
7 | 3434640000 |
oct | 1061324560 |
9 | 336832546 |
10 | 147171696 |
11 | 76090301 |
12 | 41354980 |
13 | 2464b759 |
14 | 15790000 |
15 | cdc1666 |
hex | 8c5a970 |
147171696 has 100 divisors (see below), whose sum is σ = 443880072. Its totient is φ = 42016128.
The previous prime is 147171683. The next prime is 147171721. The reversal of 147171696 is 696171741.
147171696 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 114610 + ... + 115886.
Almost surely, 2147171696 is an apocalyptic number.
147171696 is a gapful number since it is divisible by the number (16) 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 147171696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (221940036).
147171696 is an abundant number, since it is smaller than the sum of its proper divisors (296708376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
147171696 is an equidigital number, since it uses as much as digits as its factorization.
147171696 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1316 (or 1289 counting only the distinct ones).
The product of its digits is 63504, while the sum is 42.
The square root of 147171696 is about 12131.4342103479. The cubic root of 147171696 is about 527.9686046530.
The spelling of 147171696 in words is "one hundred forty-seven million, one hundred seventy-one thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •