Base | Representation |
---|---|
bin | 10001010111001… |
… | …01101111000001 |
3 | 101011001111200001 |
4 | 20223211233001 |
5 | 244241110411 |
6 | 22241400001 |
7 | 3415646323 |
oct | 1053455701 |
9 | 334044601 |
10 | 145644481 |
11 | 75237944 |
12 | 40939001 |
13 | 24235588 |
14 | 154b3613 |
15 | cbbddc1 |
hex | 8ae5bc1 |
145644481 has 8 divisors (see below), whose sum is σ = 153422720. Its totient is φ = 137877552.
The previous prime is 145644461. The next prime is 145644497. The reversal of 145644481 is 184446541.
145644481 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 145644481 - 27 = 145644353 is a prime.
It is a super-2 number, since 2×1456444812 = 42424629691518722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 145644481.
It is not an unprimeable number, because it can be changed into a prime (145644451) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41896 + ... + 45238.
It is an arithmetic number, because the mean of its divisors is an integer number (19177840).
Almost surely, 2145644481 is an apocalyptic number.
It is an amenable number.
145644481 is a deficient number, since it is larger than the sum of its proper divisors (7778239).
145644481 is a wasteful number, since it uses less digits than its factorization.
145644481 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5655.
The product of its digits is 61440, while the sum is 37.
The square root of 145644481 is about 12068.3255259377. The cubic root of 145644481 is about 526.1359903701.
The spelling of 145644481 in words is "one hundred forty-five million, six hundred forty-four thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •