Base | Representation |
---|---|
bin | 10001010100101… |
… | …00100100100011 |
3 | 101010102121122020 |
4 | 20222110210203 |
5 | 244144441120 |
6 | 22230312523 |
7 | 3413063151 |
oct | 1052244443 |
9 | 333377566 |
10 | 145312035 |
11 | 750300a0 |
12 | 407b8743 |
13 | 2414a16b |
14 | 154283d1 |
15 | cb55640 |
hex | 8a94923 |
145312035 has 32 divisors (see below), whose sum is σ = 261826560. Its totient is φ = 68179200.
The previous prime is 145312031. The next prime is 145312051. The reversal of 145312035 is 530213541.
It is not a de Polignac number, because 145312035 - 22 = 145312031 is a prime.
It is a super-2 number, since 2×1453120352 = 42231175031682450, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145311996 and 145312014.
It is not an unprimeable number, because it can be changed into a prime (145312031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9090 + ... + 19319.
It is an arithmetic number, because the mean of its divisors is an integer number (8182080).
Almost surely, 2145312035 is an apocalyptic number.
145312035 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
145312035 is a deficient number, since it is larger than the sum of its proper divisors (116514525).
145312035 is a wasteful number, since it uses less digits than its factorization.
145312035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28459.
The product of its (nonzero) digits is 1800, while the sum is 24.
The square root of 145312035 is about 12054.5441639242. The cubic root of 145312035 is about 525.7353685798.
Adding to 145312035 its reverse (530213541), we get a palindrome (675525576).
The spelling of 145312035 in words is "one hundred forty-five million, three hundred twelve thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •