Base | Representation |
---|---|
bin | 1000011010101100110… |
… | …1101010010110110001 |
3 | 111211020212110112221020 |
4 | 2012223031222112301 |
5 | 4332123214443230 |
6 | 150233053050053 |
7 | 13306324112412 |
oct | 2065315522661 |
9 | 454225415836 |
10 | 144606406065 |
11 | 56366601200 |
12 | 24038486929 |
13 | 10837013064 |
14 | 6ddb315809 |
15 | 3b6532c810 |
hex | 21ab36a5b1 |
144606406065 has 96 divisors (see below), whose sum is σ = 265623684480. Its totient is φ = 67059210240.
The previous prime is 144606406057. The next prime is 144606406093. The reversal of 144606406065 is 560604606441.
144606406065 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 144606406065 - 23 = 144606406057 is a prime.
It is a super-2 number, since 2×1446064060652 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 3943897 + ... + 3980393.
It is an arithmetic number, because the mean of its divisors is an integer number (2766913380).
Almost surely, 2144606406065 is an apocalyptic number.
144606406065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
144606406065 is a deficient number, since it is larger than the sum of its proper divisors (121017278415).
144606406065 is a wasteful number, since it uses less digits than its factorization.
144606406065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36623 (or 36612 counting only the distinct ones).
The product of its (nonzero) digits is 414720, while the sum is 42.
The spelling of 144606406065 in words is "one hundred forty-four billion, six hundred six million, four hundred six thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •