Base | Representation |
---|---|
bin | 10001011101000… |
… | …00101001000010 |
3 | 101012111101211110 |
4 | 20232200221002 |
5 | 244440110200 |
6 | 22310024150 |
7 | 3425315313 |
oct | 1056405102 |
9 | 335441743 |
10 | 146410050 |
11 | 75710046 |
12 | 41048056 |
13 | 24442b87 |
14 | 1563260a |
15 | ccc0b50 |
hex | 8ba0a42 |
146410050 has 48 divisors (see below), whose sum is σ = 364485600. Its totient is φ = 38893440.
The previous prime is 146410039. The next prime is 146410079. The reversal of 146410050 is 50014641.
It is a junction number, because it is equal to n+sod(n) for n = 146409999 and 146410026.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 40726 + ... + 44174.
It is an arithmetic number, because the mean of its divisors is an integer number (7593450).
Almost surely, 2146410050 is an apocalyptic number.
146410050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 146410050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (182242800).
146410050 is an abundant number, since it is smaller than the sum of its proper divisors (218075550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146410050 is a wasteful number, since it uses less digits than its factorization.
146410050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3747 (or 3742 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 21.
The square root of 146410050 is about 12100.0020661155. The cubic root of 146410050 is about 527.0562442746.
Adding to 146410050 its reverse (50014641), we get a palindrome (196424691).
The spelling of 146410050 in words is "one hundred forty-six million, four hundred ten thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.616 sec. • engine limits •