Base | Representation |
---|---|
bin | 10001010101011… |
… | …01010110000111 |
3 | 101010121202211121 |
4 | 20222231112013 |
5 | 244211213021 |
6 | 22232414411 |
7 | 3413665045 |
oct | 1052552607 |
9 | 333552747 |
10 | 145413511 |
11 | 7509a361 |
12 | 40847407 |
13 | 241843c9 |
14 | 15453395 |
15 | cb75741 |
hex | 8aad587 |
145413511 has 8 divisors (see below), whose sum is σ = 154098000. Its totient is φ = 136973760.
The previous prime is 145413509. The next prime is 145413523. The reversal of 145413511 is 115314541.
145413511 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 145413511 - 21 = 145413509 is a prime.
It is a super-2 number, since 2×1454135112 = 42290178362694242, which contains 22 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 (145413571) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 59961 + ... + 62338.
It is an arithmetic number, because the mean of its divisors is an integer number (19262250).
Almost surely, 2145413511 is an apocalyptic number.
145413511 is a deficient number, since it is larger than the sum of its proper divisors (8684489).
145413511 is a wasteful number, since it uses less digits than its factorization.
145413511 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122369.
The product of its digits is 1200, while the sum is 25.
The square root of 145413511 is about 12058.7524644965. The cubic root of 145413511 is about 525.8577193278.
It can be divided in two parts, 145413 and 511, that added together give a square (145924 = 3822).
The spelling of 145413511 in words is "one hundred forty-five million, four hundred thirteen thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •