Search a number
-
+
145270635 = 359684709
BaseRepresentation
bin10001010100010…
…10011101101011
3101010100111211220
420222022131223
5244142130020
622225353123
73412531356
oct1052123553
9333314756
10145270635
1175001a84
12407987a3
1324134373
141541729d
15cb48240
hex8a8a76b

145270635 has 8 divisors (see below), whose sum is σ = 232433040. Its totient is φ = 77477664.

The previous prime is 145270577. The next prime is 145270649. The reversal of 145270635 is 536072541.

145270635 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 not a de Polignac number, because 145270635 - 220 = 144222059 is a prime.

It is a super-2 number, since 2×1452706352 = 42207114786606450, which contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 145270596 and 145270605.

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4842340 + ... + 4842369.

It is an arithmetic number, because the mean of its divisors is an integer number (29054130).

Almost surely, 2145270635 is an apocalyptic number.

145270635 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

145270635 is a deficient number, since it is larger than the sum of its proper divisors (87162405).

145270635 is an equidigital number, since it uses as much as digits as its factorization.

145270635 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 9684717.

The product of its (nonzero) digits is 25200, while the sum is 33.

The square root of 145270635 is about 12052.8268468439. The cubic root of 145270635 is about 525.6854357769.

The spelling of 145270635 in words is "one hundred forty-five million, two hundred seventy thousand, six hundred thirty-five".

Divisors: 1 3 5 15 9684709 29054127 48423545 145270635