Base | Representation |
---|---|
bin | 10001010101110… |
… | …01000011010000 |
3 | 101010201012121100 |
4 | 20222321003100 |
5 | 244214231311 |
6 | 22233424400 |
7 | 3414254610 |
oct | 1052710320 |
9 | 333635540 |
10 | 145461456 |
11 | 75122388 |
12 | 4086b100 |
13 | 241a018a |
14 | 15466a40 |
15 | cb84a56 |
hex | 8ab90d0 |
145461456 has 60 divisors (see below), whose sum is σ = 465248992. Its totient is φ = 41560128.
The previous prime is 145461443. The next prime is 145461457. The reversal of 145461456 is 654164541.
145461456 is a `hidden beast` number, since 145 + 4 + 61 + 456 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 145461456.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145461457) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 71146 + ... + 73161.
Almost surely, 2145461456 is an apocalyptic number.
145461456 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
145461456 is an abundant number, since it is smaller than the sum of its proper divisors (319787536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145461456 is a wasteful number, since it uses less digits than its factorization.
145461456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144328 (or 144319 counting only the distinct ones).
The product of its digits is 57600, while the sum is 36.
The square root of 145461456 is about 12060.7402757874. The cubic root of 145461456 is about 525.9155073507.
The spelling of 145461456 in words is "one hundred forty-five million, four hundred sixty-one thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •