Base | Representation |
---|---|
bin | 10001011101001… |
… | …00101101110110 |
3 | 101012112020201200 |
4 | 20232210231312 |
5 | 244441123432 |
6 | 22310233330 |
7 | 3425415060 |
oct | 1056445566 |
9 | 335466650 |
10 | 146426742 |
11 | 75721640 |
12 | 41055846 |
13 | 2444a657 |
14 | 15638730 |
15 | ccc5a7c |
hex | 8ba4b76 |
146426742 has 96 divisors (see below), whose sum is σ = 409294080. Its totient is φ = 36711360.
The previous prime is 146426741. The next prime is 146426773. The reversal of 146426742 is 247624641.
146426742 is a `hidden beast` number, since 1 + 4 + 642 + 6 + 7 + 4 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 146426697 and 146426706.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146426741) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 38373 + ... + 42015.
It is an arithmetic number, because the mean of its divisors is an integer number (4263480).
Almost surely, 2146426742 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 146426742, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (204647040).
146426742 is an abundant number, since it is smaller than the sum of its proper divisors (262867338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146426742 is a wasteful number, since it uses less digits than its factorization.
146426742 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3698 (or 3695 counting only the distinct ones).
The product of its digits is 64512, while the sum is 36.
The square root of 146426742 is about 12100.6917984056. The cubic root of 146426742 is about 527.0762731559.
The spelling of 146426742 in words is "one hundred forty-six million, four hundred twenty-six thousand, seven hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •