Base | Representation |
---|---|
bin | 1000011000100001110… |
… | …1010010100011010111 |
3 | 111202202020020201012211 |
4 | 2012020131102203113 |
5 | 4324424431102221 |
6 | 150055143054251 |
7 | 13256013565552 |
oct | 2061035224327 |
9 | 452666221184 |
10 | 144023300311 |
11 | 56097442220 |
12 | 23ab5141387 |
13 | 10773281077 |
14 | 6d83ac9699 |
15 | 3b2e04a6e1 |
hex | 21887528d7 |
144023300311 has 16 divisors (see below), whose sum is σ = 160789749120. Its totient is φ = 127869829920.
The previous prime is 144023300287. The next prime is 144023300327. The reversal of 144023300311 is 113003320441.
It is a cyclic number.
It is not a de Polignac number, because 144023300311 - 25 = 144023300279 is a prime.
It is a super-2 number, since 2×1440233003112 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144023300611) 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, 5816425 + ... + 5841133.
It is an arithmetic number, because the mean of its divisors is an integer number (10049359320).
Almost surely, 2144023300311 is an apocalyptic number.
144023300311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
144023300311 is a deficient number, since it is larger than the sum of its proper divisors (16766448809).
144023300311 is a wasteful number, since it uses less digits than its factorization.
144023300311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37086.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 144023300311 its reverse (113003320441), we get a palindrome (257026620752).
The spelling of 144023300311 in words is "one hundred forty-four billion, twenty-three million, three hundred thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •