Base | Representation |
---|---|
bin | 10001011001110… |
… | …01000111011101 |
3 | 101011200212011101 |
4 | 20230321013131 |
5 | 244333023023 |
6 | 22252553101 |
7 | 3421601125 |
oct | 1054710735 |
9 | 334625141 |
10 | 145986013 |
11 | 754504a8 |
12 | 40a82791 |
13 | 24324b74 |
14 | 15561c85 |
15 | cc3a1ad |
hex | 8b391dd |
145986013 has 4 divisors (see below), whose sum is σ = 146015100. Its totient is φ = 145956928.
The previous prime is 145985999. The next prime is 145986019. The reversal of 145986013 is 310689541.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 310689541 = 79 ⋅3932779.
It can be written as a sum of positive squares in 2 ways, for example, as 99241444 + 46744569 = 9962^2 + 6837^2 .
It is a cyclic number.
It is not a de Polignac number, because 145986013 - 25 = 145985981 is a prime.
It is a super-3 number, since 3×1459860133 (a number of 25 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145986019) 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, 4870 + ... + 17767.
It is an arithmetic number, because the mean of its divisors is an integer number (36503775).
Almost surely, 2145986013 is an apocalyptic number.
It is an amenable number.
145986013 is a deficient number, since it is larger than the sum of its proper divisors (29087).
145986013 is an equidigital number, since it uses as much as digits as its factorization.
145986013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29086.
The product of its (nonzero) digits is 25920, while the sum is 37.
The square root of 145986013 is about 12082.4671735536. The cubic root of 145986013 is about 526.5469271042.
The spelling of 145986013 in words is "one hundred forty-five million, nine hundred eighty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •