Base | Representation |
---|---|
bin | 1000011011110001010… |
… | …0111001001101101001 |
3 | 111211222212201011210201 |
4 | 2012330110321031221 |
5 | 4333220214431401 |
6 | 150321350512201 |
7 | 13316411360503 |
oct | 2067424711551 |
9 | 454885634721 |
10 | 144893514601 |
11 | 564a3680090 |
12 | 240b8665661 |
13 | 10881649174 |
14 | 70274d0d73 |
15 | 3b80641b01 |
hex | 21bc539369 |
144893514601 has 16 divisors (see below), whose sum is σ = 162438389568. Its totient is φ = 128097964800.
The previous prime is 144893514583. The next prime is 144893514613. The reversal of 144893514601 is 106415398441.
144893514601 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 144893514601 - 27 = 144893514473 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (144893514671) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 372051 + ... + 654376.
It is an arithmetic number, because the mean of its divisors is an integer number (10152399348).
Almost surely, 2144893514601 is an apocalyptic number.
144893514601 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
144893514601 is a deficient number, since it is larger than the sum of its proper divisors (17544874967).
144893514601 is a wasteful number, since it uses less digits than its factorization.
144893514601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1026792.
The product of its (nonzero) digits is 414720, while the sum is 46.
The spelling of 144893514601 in words is "one hundred forty-four billion, eight hundred ninety-three million, five hundred fourteen thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.200 sec. • engine limits •