Base | Representation |
---|---|
bin | 10001010010101… |
… | …10011101100011 |
3 | 101002221200200000 |
4 | 20221112131203 |
5 | 244113321020 |
6 | 22221031043 |
7 | 3410653362 |
oct | 1051263543 |
9 | 332850600 |
10 | 145057635 |
11 | 74976a48 |
12 | 406b5483 |
13 | 2408b428 |
14 | 1539d7d9 |
15 | cb05090 |
hex | 8a56763 |
145057635 has 24 divisors (see below), whose sum is σ = 260747760. Its totient is φ = 77363424.
The previous prime is 145057621. The next prime is 145057639. The reversal of 145057635 is 536750541.
145057635 is a `hidden beast` number, since 1 + 4 + 50 + 576 + 35 = 666.
145057635 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 145057635 - 211 = 145055587 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 145057635.
It is not an unprimeable number, because it can be changed into a prime (145057639) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 58480 + ... + 60909.
It is an arithmetic number, because the mean of its divisors is an integer number (10864490).
Almost surely, 2145057635 is an apocalyptic number.
145057635 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
145057635 is a deficient number, since it is larger than the sum of its proper divisors (115690125).
145057635 is an equidigital number, since it uses as much as digits as its factorization.
145057635 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 119409 (or 119397 counting only the distinct ones).
The product of its (nonzero) digits is 63000, while the sum is 36.
The square root of 145057635 is about 12043.9875041450. The cubic root of 145057635 is about 525.4283850488.
The spelling of 145057635 in words is "one hundred forty-five million, fifty-seven thousand, six hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •