Base | Representation |
---|---|
bin | 1000011001001101010… |
… | …0111111101110000001 |
3 | 111210012221102022210111 |
4 | 2012103110333232001 |
5 | 4330313123103033 |
6 | 150125220031321 |
7 | 13263360005413 |
oct | 2062324775601 |
9 | 453187368714 |
10 | 144205675393 |
11 | 5618038732a |
12 | 23b46232541 |
13 | 107a1ca7010 |
14 | 6da00009b3 |
15 | 3b400727cd |
hex | 219353fb81 |
144205675393 has 16 divisors (see below), whose sum is σ = 156557592576. Its totient is φ = 132034129920.
The previous prime is 144205675381. The next prime is 144205675399. The reversal of 144205675393 is 393576502441.
144205675393 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 144205675393 - 213 = 144205667201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (144205675399) 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, 10234113 + ... + 10248193.
It is an arithmetic number, because the mean of its divisors is an integer number (9784849536).
Almost surely, 2144205675393 is an apocalyptic number.
144205675393 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
144205675393 is a deficient number, since it is larger than the sum of its proper divisors (12351917183).
144205675393 is a wasteful number, since it uses less digits than its factorization.
144205675393 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20424.
The product of its (nonzero) digits is 2721600, while the sum is 49.
The spelling of 144205675393 in words is "one hundred forty-four billion, two hundred five million, six hundred seventy-five thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •