Base | Representation |
---|---|
bin | 1000011010011010101… |
… | …1100010100001010101 |
3 | 111211001120100121122220 |
4 | 2012212223202201111 |
5 | 4331444232232323 |
6 | 150221335012553 |
7 | 13304411503152 |
oct | 2064653424125 |
9 | 454046317586 |
10 | 144530352213 |
11 | 56327685885 |
12 | 24016b0a159 |
13 | 10824334b90 |
14 | 6dd1199229 |
15 | 3b5d8080e3 |
hex | 21a6ae2855 |
144530352213 has 8 divisors (see below), whose sum is σ = 207530762208. Its totient is φ = 88941755184.
The previous prime is 144530352167. The next prime is 144530352229. The reversal of 144530352213 is 312253035441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 144530352213 - 230 = 143456610389 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144530352283) 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 7 ways as a sum of consecutive naturals, for example, 1852953195 + ... + 1852953272.
It is an arithmetic number, because the mean of its divisors is an integer number (25941345276).
Almost surely, 2144530352213 is an apocalyptic number.
144530352213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
144530352213 is a deficient number, since it is larger than the sum of its proper divisors (63000409995).
144530352213 is a wasteful number, since it uses less digits than its factorization.
144530352213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3705906483.
The product of its (nonzero) digits is 43200, while the sum is 33.
Adding to 144530352213 its reverse (312253035441), we get a palindrome (456783387654).
The spelling of 144530352213 in words is "one hundred forty-four billion, five hundred thirty million, three hundred fifty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •