Base | Representation |
---|---|
bin | 10001010100111… |
… | …00101111100001 |
3 | 101010111022112212 |
4 | 20222130233201 |
5 | 244202024010 |
6 | 22231131505 |
7 | 3413262554 |
oct | 1052345741 |
9 | 333438485 |
10 | 145345505 |
11 | 75053258 |
12 | 40813b95 |
13 | 2415c476 |
14 | 1543669b |
15 | cb60505 |
hex | 8a9cbe1 |
145345505 has 8 divisors (see below), whose sum is σ = 176015400. Its totient is φ = 115209216.
The previous prime is 145345481. The next prime is 145345507. The reversal of 145345505 is 505543541.
145345505 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 47018449 + 98327056 = 6857^2 + 9916^2 .
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 145345505 - 210 = 145344481 is a prime.
It is a super-2 number, since 2×1453455052 = 42250631647410050, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (145345507) 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, 132800 + ... + 133889.
It is an arithmetic number, because the mean of its divisors is an integer number (22001925).
Almost surely, 2145345505 is an apocalyptic number.
It is an amenable number.
145345505 is a deficient number, since it is larger than the sum of its proper divisors (30669895).
145345505 is a wasteful number, since it uses less digits than its factorization.
145345505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 266803.
The product of its (nonzero) digits is 30000, while the sum is 32.
The square root of 145345505 is about 12055.9323571427. The cubic root of 145345505 is about 525.7757300267.
The spelling of 145345505 in words is "one hundred forty-five million, three hundred forty-five thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •