Base | Representation |
---|---|
bin | 1000011000100111001… |
… | …0100110000110111100 |
3 | 111202210210022211120200 |
4 | 2012021302212012330 |
5 | 4330001142201102 |
6 | 150101302243500 |
7 | 13256404634103 |
oct | 2061162460674 |
9 | 452723284520 |
10 | 144045662652 |
11 | 560a90263a1 |
12 | 23b00726590 |
13 | 10777ab0818 |
14 | 6d86a6b03a |
15 | 3b30eb651c |
hex | 2189ca61bc |
144045662652 has 18 divisors (see below), whose sum is σ = 364115425128. Its totient is φ = 48015220872.
The previous prime is 144045662647. The next prime is 144045662671. The reversal of 144045662652 is 256266540441.
144045662652 is a `hidden beast` number, since 14 + 4 + 0 + 4 + 5 + 6 + 626 + 5 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (18).
It is a junction number, because it is equal to n+sod(n) for n = 144045662598 and 144045662607.
It is a congruent number.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 2000634168 + ... + 2000634239.
Almost surely, 2144045662652 is an apocalyptic number.
144045662652 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
144045662652 is an abundant number, since it is smaller than the sum of its proper divisors (220069762476).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144045662652 is a wasteful number, since it uses less digits than its factorization.
144045662652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4001268417 (or 4001268412 counting only the distinct ones).
The product of its (nonzero) digits is 1382400, while the sum is 45.
The spelling of 144045662652 in words is "one hundred forty-four billion, forty-five million, six hundred sixty-two thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •