Base | Representation |
---|---|
bin | 11010100010100… |
… | …100100001110101 |
3 | 1011000212001210102 |
4 | 122202210201311 |
5 | 1402442121013 |
6 | 112103403445 |
7 | 14014506440 |
oct | 3242444165 |
9 | 1130761712 |
10 | 445270133 |
11 | 209386050 |
12 | 105153585 |
13 | 71331b69 |
14 | 431ca657 |
15 | 29156d58 |
hex | 1a8a4875 |
445270133 has 32 divisors (see below), whose sum is σ = 585142272. Its totient is φ = 328521600.
The previous prime is 445270129. The next prime is 445270201. The reversal of 445270133 is 331072544.
It is a happy number.
It is not a de Polignac number, because 445270133 - 22 = 445270129 is a prime.
It is a Smith number, since the sum of its digits (29) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 445270096 and 445270105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (445270333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 181193 + ... + 183633.
It is an arithmetic number, because the mean of its divisors is an integer number (18285696).
Almost surely, 2445270133 is an apocalyptic number.
It is an amenable number.
445270133 is a deficient number, since it is larger than the sum of its proper divisors (139872139).
445270133 is a wasteful number, since it uses less digits than its factorization.
445270133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2585.
The product of its (nonzero) digits is 10080, while the sum is 29.
The square root of 445270133 is about 21101.4249044940. The cubic root of 445270133 is about 763.6151247370.
The spelling of 445270133 in words is "four hundred forty-five million, two hundred seventy thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •