Base | Representation |
---|---|
bin | 10001010010110… |
… | …01010100011001 |
3 | 101002222021201102 |
4 | 20221121110121 |
5 | 244114204322 |
6 | 22221201145 |
7 | 3411032450 |
oct | 1051312431 |
9 | 332867642 |
10 | 145069337 |
11 | 74984816 |
12 | 407001b5 |
13 | 2409385a |
14 | 153a3b97 |
15 | cb08792 |
hex | 8a59519 |
145069337 has 4 divisors (see below), whose sum is σ = 165793536. Its totient is φ = 124345140.
The previous prime is 145069333. The next prime is 145069361. The reversal of 145069337 is 733960541.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 145069337 - 22 = 145069333 is a prime.
It is a super-2 number, since 2×1450693372 = 42090225075239138, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 145069337.
It is not an unprimeable number, because it can be changed into a prime (145069333) 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, 10362089 + ... + 10362102.
It is an arithmetic number, because the mean of its divisors is an integer number (41448384).
Almost surely, 2145069337 is an apocalyptic number.
It is an amenable number.
145069337 is a deficient number, since it is larger than the sum of its proper divisors (20724199).
145069337 is an equidigital number, since it uses as much as digits as its factorization.
145069337 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20724198.
The product of its (nonzero) digits is 68040, while the sum is 38.
The square root of 145069337 is about 12044.4732969109. The cubic root of 145069337 is about 525.4425136803.
The spelling of 145069337 in words is "one hundred forty-five million, sixty-nine thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •