Base | Representation |
---|---|
bin | 1000011011001001111… |
… | …1100010111001111100 |
3 | 111211120101021022212020 |
4 | 2012302133202321330 |
5 | 4332401001102102 |
6 | 150253134440140 |
7 | 13312336150422 |
oct | 2066237427174 |
9 | 454511238766 |
10 | 144728534652 |
11 | 56419537219 |
12 | 24071363050 |
13 | 10856403ab0 |
14 | 700d627112 |
15 | 3b70e03bbc |
hex | 21b27e2e7c |
144728534652 has 48 divisors (see below), whose sum is σ = 364472801952. Its totient is φ = 44434391040.
The previous prime is 144728534651. The next prime is 144728534749. The reversal of 144728534652 is 256435827441.
It is a super-2 number, since 2×1447285346522 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 144728534595 and 144728534604.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144728534651) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 943749 + ... + 1086332.
It is an arithmetic number, because the mean of its divisors is an integer number (7593183374).
Almost surely, 2144728534652 is an apocalyptic number.
144728534652 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
144728534652 is an abundant number, since it is smaller than the sum of its proper divisors (219744267300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144728534652 is a wasteful number, since it uses less digits than its factorization.
144728534652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2030558 (or 2030556 counting only the distinct ones).
The product of its digits is 6451200, while the sum is 51.
The spelling of 144728534652 in words is "one hundred forty-four billion, seven hundred twenty-eight million, five hundred thirty-four thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •