Base | Representation |
---|---|
bin | 1000011001000000111… |
… | …0100100111100010111 |
3 | 111210002022112201202011 |
4 | 2012100032210330113 |
5 | 4330211314124312 |
6 | 150120121125051 |
7 | 13262155621513 |
oct | 2062016447427 |
9 | 453068481664 |
10 | 144153661207 |
11 | 56153a902a6 |
12 | 23b30929787 |
13 | 10794294baa |
14 | 6d97141143 |
15 | 3b3a6eada7 |
hex | 21903a4f17 |
144153661207 has 2 divisors, whose sum is σ = 144153661208. Its totient is φ = 144153661206.
The previous prime is 144153661117. The next prime is 144153661241. The reversal of 144153661207 is 702166351441.
It is a strong prime.
It is an emirp because it is prime and its reverse (702166351441) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 144153661207 - 215 = 144153628439 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 144153661207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (144153661807) 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 as a sum of consecutive naturals, namely, 72076830603 + 72076830604.
It is an arithmetic number, because the mean of its divisors is an integer number (72076830604).
Almost surely, 2144153661207 is an apocalyptic number.
144153661207 is a deficient number, since it is larger than the sum of its proper divisors (1).
144153661207 is an equidigital number, since it uses as much as digits as its factorization.
144153661207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120960, while the sum is 40.
The spelling of 144153661207 in words is "one hundred forty-four billion, one hundred fifty-three million, six hundred sixty-one thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •