Base | Representation |
---|---|
bin | 10001010100001… |
… | …11111111101011 |
3 | 101010022222222101 |
4 | 20222013333223 |
5 | 244141314043 |
6 | 22225234231 |
7 | 3412460032 |
oct | 1052077753 |
9 | 333288871 |
10 | 145260523 |
11 | 74aa5421 |
12 | 40792977 |
13 | 2412c895 |
14 | 15413719 |
15 | cb4524d |
hex | 8a87feb |
145260523 has 4 divisors (see below), whose sum is σ = 146698848. Its totient is φ = 143822200.
The previous prime is 145260517. The next prime is 145260551. The reversal of 145260523 is 325062541.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145260523 is a prime.
It is a super-2 number, since 2×1452605232 = 42201239084467058, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 145260491 and 145260500.
It is not an unprimeable number, because it can be changed into a prime (145266523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 719011 + ... + 719212.
It is an arithmetic number, because the mean of its divisors is an integer number (36674712).
Almost surely, 2145260523 is an apocalyptic number.
145260523 is a deficient number, since it is larger than the sum of its proper divisors (1438325).
145260523 is a wasteful number, since it uses less digits than its factorization.
145260523 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1438324.
The product of its (nonzero) digits is 7200, while the sum is 28.
The square root of 145260523 is about 12052.4073528901. The cubic root of 145260523 is about 525.6732381879.
The spelling of 145260523 in words is "one hundred forty-five million, two hundred sixty thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •