Base | Representation |
---|---|
bin | 1000100001110010011… |
… | …1111000010110100111 |
3 | 112000011110201122120112 |
4 | 2020130213320112213 |
5 | 4400022312321201 |
6 | 151145542323235 |
7 | 13404426561335 |
oct | 2103447702647 |
9 | 460143648515 |
10 | 146509104551 |
11 | 5715262a797 |
12 | 2448972951b |
13 | 10a7b27cc54 |
14 | 713bcc2b55 |
15 | 3c273c00bb |
hex | 221c9f85a7 |
146509104551 has 12 divisors (see below), whose sum is σ = 148786961400. Its totient is φ = 144265627440.
The previous prime is 146509104527. The next prime is 146509104571. The reversal of 146509104551 is 155401905641.
146509104551 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 146509104551 - 26 = 146509104487 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 146509104499 and 146509104508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146509104571) 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 11 ways as a sum of consecutive naturals, for example, 15666425 + ... + 15675773.
It is an arithmetic number, because the mean of its divisors is an integer number (12398913450).
Almost surely, 2146509104551 is an apocalyptic number.
146509104551 is a deficient number, since it is larger than the sum of its proper divisors (2277856849).
146509104551 is an frugal number, since it uses more digits than its factorization.
146509104551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12974 (or 12907 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 41.
The spelling of 146509104551 in words is "one hundred forty-six billion, five hundred nine million, one hundred four thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •