Base | Representation |
---|---|
bin | 100000111000110100010111… |
… | …110101111100010111101001 |
3 | 200222010122022121212120011021 |
4 | 200320310113311330113221 |
5 | 122424303320443104030 |
6 | 1231343342421332441 |
7 | 42316016636161054 |
oct | 4070642765742751 |
9 | 628118277776137 |
10 | 144642013644265 |
11 | 420a6373990165 |
12 | 14280711867121 |
13 | 62928b645c767 |
14 | 27a09d4689a9b |
15 | 11ac70d9a697a |
hex | 838d17d7c5e9 |
144642013644265 has 8 divisors (see below), whose sum is σ = 173573302408200. Its totient is φ = 115711686892032.
The previous prime is 144642013644257. The next prime is 144642013644281. The reversal of 144642013644265 is 562446310246441.
It can be written as a sum of positive squares in 4 ways, for example, as 41210082962064 + 103431930682201 = 6419508^2 + 10170149^2 .
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 144642013644265 - 23 = 144642013644257 is a prime.
It is a super-2 number, since 2×1446420136442652 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 240172104 + ... + 240773593.
It is an arithmetic number, because the mean of its divisors is an integer number (21696662801025).
Almost surely, 2144642013644265 is an apocalyptic number.
It is an amenable number.
144642013644265 is a deficient number, since it is larger than the sum of its proper divisors (28931288763935).
144642013644265 is an equidigital number, since it uses as much as digits as its factorization.
144642013644265 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 481005851.
The product of its (nonzero) digits is 13271040, while the sum is 52.
The spelling of 144642013644265 in words is "one hundred forty-four trillion, six hundred forty-two billion, thirteen million, six hundred forty-four thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •