Base | Representation |
---|---|
bin | 10001010010010… |
… | …11011010110101 |
3 | 101002212101121211 |
4 | 20221023122311 |
5 | 244110344110 |
6 | 22220041421 |
7 | 3410404456 |
oct | 1051133265 |
9 | 332771554 |
10 | 145012405 |
11 | 74945a6a |
12 | 40693271 |
13 | 24073975 |
14 | 1538b12d |
15 | cae698a |
hex | 8a4b6b5 |
145012405 has 4 divisors (see below), whose sum is σ = 174014892. Its totient is φ = 116009920.
The previous prime is 145012403. The next prime is 145012421. The reversal of 145012405 is 504210541.
145012405 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 110649361 + 34363044 = 10519^2 + 5862^2 .
It is not a de Polignac number, because 145012405 - 21 = 145012403 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145012403) 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, 14501236 + ... + 14501245.
It is an arithmetic number, because the mean of its divisors is an integer number (43503723).
Almost surely, 2145012405 is an apocalyptic number.
It is an amenable number.
145012405 is a deficient number, since it is larger than the sum of its proper divisors (29002487).
145012405 is an equidigital number, since it uses as much as digits as its factorization.
145012405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29002486.
The product of its (nonzero) digits is 800, while the sum is 22.
The square root of 145012405 is about 12042.1096573649. The cubic root of 145012405 is about 525.3737686054.
Adding to 145012405 its reverse (504210541), we get a palindrome (649222946).
The spelling of 145012405 in words is "one hundred forty-five million, twelve thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •