Base | Representation |
---|---|
bin | 10001011100110… |
… | …00011111000000 |
3 | 101012102201000001 |
4 | 20232120133000 |
5 | 244433023030 |
6 | 22305205344 |
7 | 3425116024 |
oct | 1056303700 |
9 | 335381001 |
10 | 146376640 |
11 | 75697a33 |
12 | 41030854 |
13 | 244308c7 |
14 | 15624384 |
15 | ccb5cca |
hex | 8b987c0 |
146376640 has 56 divisors (see below), whose sum is σ = 354512880. Its totient is φ = 57550848.
The previous prime is 146376631. The next prime is 146376667. The reversal of 146376640 is 46673641.
It is a super-2 number, since 2×1463766402 = 42852241475379200, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 146376640.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15004 + ... + 22756.
Almost surely, 2146376640 is an apocalyptic number.
146376640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 146376640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (177256440).
146376640 is an abundant number, since it is smaller than the sum of its proper divisors (208136240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146376640 is an equidigital number, since it uses as much as digits as its factorization.
146376640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7829 (or 7819 counting only the distinct ones).
The product of its (nonzero) digits is 72576, while the sum is 37.
The square root of 146376640 is about 12098.6214090697. The cubic root of 146376640 is about 527.0161507412.
The spelling of 146376640 in words is "one hundred forty-six million, three hundred seventy-six thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •