Base | Representation |
---|---|
bin | 10001011100000… |
… | …01101001011000 |
3 | 101012020221200110 |
4 | 20232001221120 |
5 | 244422024341 |
6 | 22303204320 |
7 | 3424246221 |
oct | 1056015130 |
9 | 335227613 |
10 | 146283096 |
11 | 75633723 |
12 | 40ba66a0 |
13 | 243ca15b |
14 | 155dc248 |
15 | cc98216 |
hex | 8b81a58 |
146283096 has 64 divisors (see below), whose sum is σ = 389577600. Its totient is φ = 45613568.
The previous prime is 146283083. The next prime is 146283107. The reversal of 146283096 is 690382641.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 72031 + ... + 74033.
It is an arithmetic number, because the mean of its divisors is an integer number (6087150).
Almost surely, 2146283096 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 146283096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (194788800).
146283096 is an abundant number, since it is smaller than the sum of its proper divisors (243294504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146283096 is a wasteful number, since it uses less digits than its factorization.
146283096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2208 (or 2204 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 39.
The square root of 146283096 is about 12094.7548962350. The cubic root of 146283096 is about 526.9038611839.
The spelling of 146283096 in words is "one hundred forty-six million, two hundred eighty-three thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •