Base | Representation |
---|---|
bin | 10000101001100100000… |
… | …100000111000111000000 |
3 | 11001101020002110011210110 |
4 | 100221210010013013000 |
5 | 122221144331200112 |
6 | 2233335525031320 |
7 | 145442600246556 |
oct | 20514404070700 |
9 | 4041202404713 |
10 | 1144140100032 |
11 | 401255293506 |
12 | 1658aa255540 |
13 | 83b797c2c67 |
14 | 3d53b857bd6 |
15 | 1eb65b8413c |
hex | 10a641071c0 |
1144140100032 has 112 divisors (see below), whose sum is σ = 3034380621600. Its totient is φ = 380476981248.
The previous prime is 1144140100031. The next prime is 1144140100039. The reversal of 1144140100032 is 2300010414411.
It is a junction number, because it is equal to n+sod(n) for n = 1144140099981 and 1144140100008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1144140100031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 177410344 + ... + 177416792.
Almost surely, 21144140100032 is an apocalyptic number.
1144140100032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1144140100032 is an abundant number, since it is smaller than the sum of its proper divisors (1890240521568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1144140100032 is a wasteful number, since it uses less digits than its factorization.
1144140100032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8510 (or 8500 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 1144140100032 its reverse (2300010414411), we get a palindrome (3444150514443).
The spelling of 1144140100032 in words is "one trillion, one hundred forty-four billion, one hundred forty million, one hundred thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •