Base | Representation |
---|---|
bin | 10001010100010… |
… | …00110000100111 |
3 | 101010100011021101 |
4 | 20222020300213 |
5 | 244141414110 |
6 | 22225300531 |
7 | 3412502125 |
oct | 1052106047 |
9 | 333304241 |
10 | 145263655 |
11 | 74aa7809 |
12 | 40794747 |
13 | 24131134 |
14 | 15414915 |
15 | cb4613a |
hex | 8a88c27 |
145263655 has 8 divisors (see below), whose sum is σ = 174418992. Its totient is φ = 116142528.
The previous prime is 145263641. The next prime is 145263659. The reversal of 145263655 is 556362541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 145263655 - 215 = 145230887 is a prime.
It is a super-2 number, since 2×1452636552 = 42203058927918050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145263659) 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 7 ways as a sum of consecutive naturals, for example, 1972 + ... + 17158.
It is an arithmetic number, because the mean of its divisors is an integer number (21802374).
Almost surely, 2145263655 is an apocalyptic number.
145263655 is a deficient number, since it is larger than the sum of its proper divisors (29155337).
145263655 is a wasteful number, since it uses less digits than its factorization.
145263655 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17105.
The product of its digits is 108000, while the sum is 37.
The square root of 145263655 is about 12052.5372847380. The cubic root of 145263655 is about 525.6770162200.
It can be divided in two parts, 14526 and 3655, that added together give a palindrome (18181).
The spelling of 145263655 in words is "one hundred forty-five million, two hundred sixty-three thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •