Base | Representation |
---|---|
bin | 1000011101000010001… |
… | …1011010011101100001 |
3 | 111212212112020222012111 |
4 | 2013100203122131201 |
5 | 4334414103140441 |
6 | 150415152155321 |
7 | 13331001661561 |
oct | 2072043323541 |
9 | 455775228174 |
10 | 145232865121 |
11 | 56658191163 |
12 | 24192238b41 |
13 | 10906a43ca6 |
14 | 705a5c8da1 |
15 | 3ba0325081 |
hex | 21d08da761 |
145232865121 has 16 divisors (see below), whose sum is σ = 154392071760. Its totient is φ = 136143155200.
The previous prime is 145232865103. The next prime is 145232865137. The reversal of 145232865121 is 121568232541.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 79343622400 + 65889242721 = 281680^2 + 256689^2 .
It is a cyclic number.
It is not a de Polignac number, because 145232865121 - 213 = 145232856929 is a prime.
It is a super-2 number, since 2×1452328651212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145232865161) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 4599375 + ... + 4630843.
It is an arithmetic number, because the mean of its divisors is an integer number (9649504485).
Almost surely, 2145232865121 is an apocalyptic number.
It is an amenable number.
145232865121 is a deficient number, since it is larger than the sum of its proper divisors (9159206639).
145232865121 is a wasteful number, since it uses less digits than its factorization.
145232865121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32564.
The product of its digits is 115200, while the sum is 40.
The spelling of 145232865121 in words is "one hundred forty-five billion, two hundred thirty-two million, eight hundred sixty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •