Base | Representation |
---|---|
bin | 10001010101000… |
… | …00111110100111 |
3 | 101010112012100110 |
4 | 20222200332213 |
5 | 244203102410 |
6 | 22231344103 |
7 | 3413364261 |
oct | 1052407647 |
9 | 333465313 |
10 | 145362855 |
11 | 750652a0 |
12 | 40822033 |
13 | 24167331 |
14 | 1543cb31 |
15 | cb65720 |
hex | 8aa0fa7 |
145362855 has 32 divisors (see below), whose sum is σ = 254907648. Its totient is φ = 70150400.
The previous prime is 145362823. The next prime is 145362859. The reversal of 145362855 is 558263541.
145362855 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 145362855 - 25 = 145362823 is a prime.
It is a super-2 number, since 2×1453628552 = 42260719227502050, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145362859) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 35515 + ... + 39395.
It is an arithmetic number, because the mean of its divisors is an integer number (7965864).
Almost surely, 2145362855 is an apocalyptic number.
145362855 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
145362855 is a deficient number, since it is larger than the sum of its proper divisors (109544793).
145362855 is a wasteful number, since it uses less digits than its factorization.
145362855 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4127.
The product of its digits is 144000, while the sum is 39.
The square root of 145362855 is about 12056.6518984335. The cubic root of 145362855 is about 525.7966499397.
It can be divided in two parts, 14536 and 2855, that added together give a triangular number (17391 = T186).
The spelling of 145362855 in words is "one hundred forty-five million, three hundred sixty-two thousand, eight hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •