Base | Representation |
---|---|
bin | 10001011010000… |
… | …00110111001100 |
3 | 101011202110200110 |
4 | 20231000313030 |
5 | 244340031430 |
6 | 22253400020 |
7 | 3422062461 |
oct | 1055006714 |
9 | 334673613 |
10 | 146017740 |
11 | 75472320 |
12 | 40a99010 |
13 | 2433643b |
14 | 1556d668 |
15 | cc447b0 |
hex | 8b40dcc |
146017740 has 48 divisors (see below), whose sum is σ = 446019840. Its totient is φ = 35398080.
The previous prime is 146017733. The next prime is 146017747. The reversal of 146017740 is 47710641.
It is an interprime number because it is at equal distance from previous prime (146017733) and next prime (146017747).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 146017698 and 146017707.
It is not an unprimeable number, because it can be changed into a prime (146017747) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 109960 + ... + 111279.
It is an arithmetic number, because the mean of its divisors is an integer number (9292080).
Almost surely, 2146017740 is an apocalyptic number.
146017740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
146017740 is an abundant number, since it is smaller than the sum of its proper divisors (300002100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146017740 is a wasteful number, since it uses less digits than its factorization.
146017740 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 221262 (or 221260 counting only the distinct ones).
The product of its (nonzero) digits is 4704, while the sum is 30.
The square root of 146017740 is about 12083.7800377200. The cubic root of 146017740 is about 526.5850689872.
The spelling of 146017740 in words is "one hundred forty-six million, seventeen thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •