Base | Representation |
---|---|
bin | 1000011110010000111… |
… | …0110011000011000101 |
3 | 111220201112110211011001 |
4 | 2013210032303003011 |
5 | 4341103112131000 |
6 | 150512024213301 |
7 | 13342121062066 |
oct | 2074416630305 |
9 | 456645424131 |
10 | 145563005125 |
11 | 5680758123a |
12 | 2426490a231 |
13 | 1095a2656c5 |
14 | 708c3a656d |
15 | 3bbe2d946a |
hex | 21e43b30c5 |
145563005125 has 8 divisors (see below), whose sum is σ = 181662630552. Its totient is φ = 116450404000.
The previous prime is 145563005083. The next prime is 145563005149. The reversal of 145563005125 is 521500365541.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 1504043524 + 144058961601 = 38782^2 + 379551^2 .
It is not a de Polignac number, because 145563005125 - 219 = 145562480837 is a prime.
It is a super-2 number, since 2×1455630051252 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 582251896 + ... + 582252145.
It is an arithmetic number, because the mean of its divisors is an integer number (22707828819).
Almost surely, 2145563005125 is an apocalyptic number.
It is an amenable number.
145563005125 is a deficient number, since it is larger than the sum of its proper divisors (36099625427).
145563005125 is an equidigital number, since it uses as much as digits as its factorization.
145563005125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1164504056 (or 1164504046 counting only the distinct ones).
The product of its (nonzero) digits is 90000, while the sum is 37.
The spelling of 145563005125 in words is "one hundred forty-five billion, five hundred sixty-three million, five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •