Base | Representation |
---|---|
bin | 100000110010111111000000… |
… | …101110000110000010110101 |
3 | 200220201022112122202212222200 |
4 | 200302333000232012002311 |
5 | 122401221303210313141 |
6 | 1230435242235415113 |
7 | 42245035263414420 |
oct | 4062770056060265 |
9 | 626638478685880 |
10 | 144241120010421 |
11 | 41a613519844a5 |
12 | 14216a8b2b4499 |
13 | 6263b579465c5 |
14 | 27894439469b7 |
15 | 11a20988dcab6 |
hex | 832fc0b860b5 |
144241120010421 has 48 divisors (see below), whose sum is σ = 242024852334720. Its totient is φ = 81069261816960.
The previous prime is 144241120010357. The next prime is 144241120010441. The reversal of 144241120010421 is 124010021142441.
144241120010421 is a `hidden beast` number, since 1 + 4 + 4 + 2 + 411 + 200 + 1 + 0 + 42 + 1 = 666.
It is not a de Polignac number, because 144241120010421 - 26 = 144241120010357 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144241120010441) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 104160715 + ... + 105536423.
It is an arithmetic number, because the mean of its divisors is an integer number (5042184423640).
Almost surely, 2144241120010421 is an apocalyptic number.
It is an amenable number.
144241120010421 is a deficient number, since it is larger than the sum of its proper divisors (97783732324299).
144241120010421 is a wasteful number, since it uses less digits than its factorization.
144241120010421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1403066 (or 1403063 counting only the distinct ones).
The product of its (nonzero) digits is 2048, while the sum is 27.
Adding to 144241120010421 its reverse (124010021142441), we get a palindrome (268251141152862).
The spelling of 144241120010421 in words is "one hundred forty-four trillion, two hundred forty-one billion, one hundred twenty million, ten thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •