Base | Representation |
---|---|
bin | 1000100000010011111… |
… | …0001001000101101000 |
3 | 111222010211001020100011 |
4 | 2020010332021011220 |
5 | 4343214221141310 |
6 | 151042325221304 |
7 | 13361540643154 |
oct | 2100476110550 |
9 | 458124036304 |
10 | 146112287080 |
11 | 56a69638971 |
12 | 24398861834 |
13 | 10a16cb4106 |
14 | 710130a064 |
15 | 3c0263978a |
hex | 2204f89168 |
146112287080 has 16 divisors (see below), whose sum is σ = 328752646020. Its totient is φ = 58444914816.
The previous prime is 146112287071. The next prime is 146112287081. The reversal of 146112287080 is 80782211641.
It can be written as a sum of positive squares in 2 ways, for example, as 144934012804 + 1178274276 = 380702^2 + 34326^2 .
It is a Harshad number since it is a multiple of its sum of digits (40), and also a Moran number because the ratio is a prime number: 3652807177 = 146112287080 / (1 + 4 + 6 + 1 + 1 + 2 + 2 + 8 + 7 + 0 + 8 + 0).
It is not an unprimeable number, because it can be changed into a prime (146112287081) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1826403549 + ... + 1826403628.
Almost surely, 2146112287080 is an apocalyptic number.
146112287080 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
146112287080 is an abundant number, since it is smaller than the sum of its proper divisors (182640358940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146112287080 is a wasteful number, since it uses less digits than its factorization.
146112287080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3652807188 (or 3652807184 counting only the distinct ones).
The product of its (nonzero) digits is 43008, while the sum is 40.
The spelling of 146112287080 in words is "one hundred forty-six billion, one hundred twelve million, two hundred eighty-seven thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •