Base | Representation |
---|---|
bin | 1000011001011010100… |
… | …0001010111010101010 |
3 | 111210100210120211001000 |
4 | 2012112220022322222 |
5 | 4330421311034032 |
6 | 150134514335430 |
7 | 13264631360625 |
oct | 2062650127252 |
9 | 453323524030 |
10 | 144261033642 |
11 | 561a9657850 |
12 | 23b6088a576 |
13 | 107b05ba28b |
14 | 6da74d0dbc |
15 | 3b44d59e7c |
hex | 2196a0aeaa |
144261033642 has 64 divisors (see below), whose sum is σ = 364929131520. Its totient is φ = 41814788400.
The previous prime is 144261033593. The next prime is 144261033649. The reversal of 144261033642 is 246330162441.
144261033642 is a `hidden beast` number, since 1 + 4 + 4 + 2 + 6 + 1 + 0 + 3 + 3 + 642 = 666.
It is a super-2 number, since 2×1442610336422 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 144261033597 and 144261033606.
It is not an unprimeable number, because it can be changed into a prime (144261033649) 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 31 ways as a sum of consecutive naturals, for example, 5265984 + ... + 5293307.
It is an arithmetic number, because the mean of its divisors is an integer number (5702017680).
Almost surely, 2144261033642 is an apocalyptic number.
144261033642 is an abundant number, since it is smaller than the sum of its proper divisors (220668097878).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144261033642 is a wasteful number, since it uses less digits than its factorization.
144261033642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10559336 (or 10559330 counting only the distinct ones).
The product of its (nonzero) digits is 82944, while the sum is 36.
The spelling of 144261033642 in words is "one hundred forty-four billion, two hundred sixty-one million, thirty-three thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •