Base | Representation |
---|---|
bin | 1000100001111000110… |
… | …0010100111101110110 |
3 | 112000020022021102201221 |
4 | 2020132030110331312 |
5 | 4400101032424100 |
6 | 151152322540554 |
7 | 13405166441005 |
oct | 2103614247566 |
9 | 460208242657 |
10 | 146535436150 |
11 | 57166485044 |
12 | 2449650775a |
13 | 10a8386c28c |
14 | 71415b8c3c |
15 | 3c2987201a |
hex | 221e314f76 |
146535436150 has 96 divisors (see below), whose sum is σ = 279894942720. Its totient is φ = 57055764480.
The previous prime is 146535436133. The next prime is 146535436153. The reversal of 146535436150 is 51634535641.
146535436150 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 146535436097 and 146535436106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146535436153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 358277146 + ... + 358277554.
It is an arithmetic number, because the mean of its divisors is an integer number (2915572320).
Almost surely, 2146535436150 is an apocalyptic number.
146535436150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
146535436150 is a deficient number, since it is larger than the sum of its proper divisors (133359506570).
146535436150 is a wasteful number, since it uses less digits than its factorization.
146535436150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1210 (or 1205 counting only the distinct ones).
The product of its (nonzero) digits is 648000, while the sum is 43.
The spelling of 146535436150 in words is "one hundred forty-six billion, five hundred thirty-five million, four hundred thirty-six thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •