Base | Representation |
---|---|
bin | 100000110001000101000101… |
… | …011101010111101111011011 |
3 | 200220020210121211100012021201 |
4 | 200301011011131113233123 |
5 | 122342100143432310021 |
6 | 1230255151402015031 |
7 | 42232422113314450 |
oct | 4061050535275733 |
9 | 626223554305251 |
10 | 144110203010011 |
11 | 41a10880721397 |
12 | 141b56334a7477 |
13 | 62546c2aa53a4 |
14 | 2782d84777827 |
15 | 119d9852e0591 |
hex | 831145757bdb |
144110203010011 has 8 divisors (see below), whose sum is σ = 167488855799040. Its totient is φ = 121429420453608.
The previous prime is 144110203010009. The next prime is 144110203010027. The reversal of 144110203010011 is 110010302011441.
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 144110203010011 - 21 = 144110203010009 is a prime.
It is a super-2 number, since 2×1441102030100112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (144110203010611) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 174467557711 + ... + 174467558536.
It is an arithmetic number, because the mean of its divisors is an integer number (20936106974880).
Almost surely, 2144110203010011 is an apocalyptic number.
144110203010011 is a deficient number, since it is larger than the sum of its proper divisors (23378652789029).
144110203010011 is an equidigital number, since it uses as much as digits as its factorization.
144110203010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 348935116313.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 144110203010011 its reverse (110010302011441), we get a palindrome (254120505021452).
The spelling of 144110203010011 in words is "one hundred forty-four trillion, one hundred ten billion, two hundred three million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •