Base | Representation |
---|---|
bin | 10001011001100… |
… | …00100101010001 |
3 | 101011122002012201 |
4 | 20230300211101 |
5 | 244330413212 |
6 | 22252123201 |
7 | 3421364200 |
oct | 1054604521 |
9 | 334562181 |
10 | 145951057 |
11 | 7542720a |
12 | 40a66501 |
13 | 24311c95 |
14 | 15553237 |
15 | cc2eb57 |
hex | 8b30951 |
145951057 has 6 divisors (see below), whose sum is σ = 169779858. Its totient is φ = 125100864.
The previous prime is 145951049. The next prime is 145951063. The reversal of 145951057 is 750159541.
It can be written as a sum of positive squares in only one way, i.e., 92236816 + 53714241 = 9604^2 + 7329^2 .
It is not a de Polignac number, because 145951057 - 23 = 145951049 is a prime.
It is a super-2 number, since 2×1459510572 = 42603422078834498, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145951037) 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 5 ways as a sum of consecutive naturals, for example, 1489248 + ... + 1489345.
It is an arithmetic number, because the mean of its divisors is an integer number (28296643).
Almost surely, 2145951057 is an apocalyptic number.
It is an amenable number.
145951057 is a deficient number, since it is larger than the sum of its proper divisors (23828801).
145951057 is an equidigital number, since it uses as much as digits as its factorization.
145951057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2978607 (or 2978600 counting only the distinct ones).
The product of its (nonzero) digits is 31500, while the sum is 37.
The square root of 145951057 is about 12081.0205280845. The cubic root of 145951057 is about 526.5048969505.
The spelling of 145951057 in words is "one hundred forty-five million, nine hundred fifty-one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •