Base | Representation |
---|---|
bin | 10001010011001… |
… | …10110101101001 |
3 | 101010002002200101 |
4 | 20221212311221 |
5 | 244122442323 |
6 | 22222305401 |
7 | 3411353056 |
oct | 1051466551 |
9 | 333062611 |
10 | 145124713 |
11 | 74a12388 |
12 | 40728261 |
13 | 240b2b16 |
14 | 153ba02d |
15 | cb19dad |
hex | 8a66d69 |
145124713 has 4 divisors (see below), whose sum is σ = 145460308. Its totient is φ = 144789120.
The previous prime is 145124663. The next prime is 145124723. The reversal of 145124713 is 317421541.
145124713 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 35964009 + 109160704 = 5997^2 + 10448^2 .
It is a cyclic number.
It is not a de Polignac number, because 145124713 - 221 = 143027561 is a prime.
It is a super-2 number, since 2×1451247132 = 42122364646664738, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145124723) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 167148 + ... + 168013.
It is an arithmetic number, because the mean of its divisors is an integer number (36365077).
Almost surely, 2145124713 is an apocalyptic number.
It is an amenable number.
145124713 is a deficient number, since it is larger than the sum of its proper divisors (335595).
145124713 is an equidigital number, since it uses as much as digits as its factorization.
145124713 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 335594.
The product of its digits is 3360, while the sum is 28.
The square root of 145124713 is about 12046.7718912578. The cubic root of 145124713 is about 525.5093626408.
The spelling of 145124713 in words is "one hundred forty-five million, one hundred twenty-four thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •