Base | Representation |
---|---|
bin | 1000100001100011001… |
… | …1001000010111001010 |
3 | 112000000000000000000000 |
4 | 2020120303020113022 |
5 | 4344404401213332 |
6 | 151135331223430 |
7 | 13403020330650 |
oct | 2103063102712 |
9 | 460000000000 |
10 | 146444944842 |
11 | 5711a398639 |
12 | 24470147b76 |
13 | 10a6aba7821 |
14 | 7133580dd0 |
15 | 3c21949b7c |
hex | 2218cc85ca |
146444944842 has 88 divisors (see below), whose sum is σ = 376572715296. Its totient is φ = 41841412812.
The previous prime is 146444944801. The next prime is 146444944873. The reversal of 146444944842 is 248449444641.
146444944842 is a `hidden beast` number, since 14 + 64 + 4 + 4 + 94 + 484 + 2 = 666.
It is a super-2 number, since 2×1464449448422 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
Its product of digits (14155776) is a multiple of the sum of its prime divisors (12).
It is an unprimeable number.
It is a polite number, since it can be written in 43 ways as a sum of consecutive naturals, for example, 20920706403 + ... + 20920706409.
Almost surely, 2146444944842 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 146444944842, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (188286357648).
146444944842 is an abundant number, since it is smaller than the sum of its proper divisors (230127770454).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146444944842 is an frugal number, since it uses more digits than its factorization.
146444944842 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72 (or 12 counting only the distinct ones).
The product of its digits is 14155776, while the sum is 54.
The spelling of 146444944842 in words is "one hundred forty-six billion, four hundred forty-four million, nine hundred forty-four thousand, eight hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •