Base | Representation |
---|---|
bin | 100010111010010111001000… |
… | …100001001111011101110000 |
3 | 202010122200021211000021120012 |
4 | 202322113020201033131300 |
5 | 130111131404401201000 |
6 | 1302321113031034052 |
7 | 44225125113655343 |
oct | 4272271041173560 |
9 | 663580254007505 |
10 | 153544150022000 |
11 | 44a18787888421 |
12 | 15279a7520b928 |
13 | 678a1c72c674a |
14 | 29cb80dd4a45a |
15 | 12b4080799735 |
hex | 8ba5c884f770 |
153544150022000 has 80 divisors (see below), whose sum is σ = 372581663387232. Its totient is φ = 61200636249600.
The previous prime is 153544150021987. The next prime is 153544150022009. The reversal of 153544150022000 is 220051445351.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153544150022009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 135073709 + ... + 136205708.
Almost surely, 2153544150022000 is an apocalyptic number.
153544150022000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
153544150022000 is an abundant number, since it is smaller than the sum of its proper divisors (219037513365232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153544150022000 is a wasteful number, since it uses less digits than its factorization.
153544150022000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271279723 (or 271279707 counting only the distinct ones).
The product of its (nonzero) digits is 24000, while the sum is 32.
The spelling of 153544150022000 in words is "one hundred fifty-three trillion, five hundred forty-four billion, one hundred fifty million, twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •