Base | Representation |
---|---|
bin | 100001010011001010100011… |
… | …000111111000011101110001 |
3 | 201012112201120201211211020011 |
4 | 201103022203013320131301 |
5 | 123143434241043032010 |
6 | 1235251210401014521 |
7 | 42563563155032500 |
oct | 4123124307703561 |
9 | 635481521754204 |
10 | 146452531611505 |
11 | 427341960a3259 |
12 | 14513594624441 |
13 | 6394550798302 |
14 | 28244a9ccc837 |
15 | 11de876ad4a8a |
hex | 8532a31f8771 |
146452531611505 has 48 divisors (see below), whose sum is σ = 206369471777040. Its totient is φ = 99475228113408.
The previous prime is 146452531611481. The next prime is 146452531611613. The reversal of 146452531611505 is 505116135254641.
It can be written as a sum of positive squares in 8 ways, for example, as 17165716781409 + 129286814830096 = 4143153^2 + 11370436^2 .
It is not a de Polignac number, because 146452531611505 - 219 = 146452531087217 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 94218799 + ... + 95760571.
It is an arithmetic number, because the mean of its divisors is an integer number (4299363995355).
Almost surely, 2146452531611505 is an apocalyptic number.
It is an amenable number.
146452531611505 is a deficient number, since it is larger than the sum of its proper divisors (59916940165535).
146452531611505 is a wasteful number, since it uses less digits than its factorization.
146452531611505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1545458 (or 1545451 counting only the distinct ones).
The product of its (nonzero) digits is 2160000, while the sum is 49.
The spelling of 146452531611505 in words is "one hundred forty-six trillion, four hundred fifty-two billion, five hundred thirty-one million, six hundred eleven thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •