Base | Representation |
---|---|
bin | 1000100001011011111… |
… | …0001011110100101100 |
3 | 111222220212022110221210 |
4 | 2020112332023310230 |
5 | 4344324024210142 |
6 | 151132314154420 |
7 | 13402165625625 |
oct | 2102676136454 |
9 | 458825273853 |
10 | 146414288172 |
11 | 57104059849 |
12 | 24461a22a10 |
13 | 10a64732999 |
14 | 712d480a4c |
15 | 3c1dde149c |
hex | 2216f8bd2c |
146414288172 has 18 divisors (see below), whose sum is σ = 341636431948. Its totient is φ = 48804320888.
The previous prime is 146414288171. The next prime is 146414288203. The reversal of 146414288172 is 271882414641.
146414288172 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (146414288171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1270279 + ... + 1380737.
Almost surely, 2146414288172 is an apocalyptic number.
146414288172 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
146414288172 is an abundant number, since it is smaller than the sum of its proper divisors (195222143776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146414288172 is an frugal number, since it uses more digits than its factorization.
146414288172 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220925 (or 110464 counting only the distinct ones).
The product of its digits is 688128, while the sum is 48.
Multiplying 146414288172 by its sum of digits (48), we get a square (7027885832256 = 26510162).
The spelling of 146414288172 in words is "one hundred forty-six billion, four hundred fourteen million, two hundred eighty-eight thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •