Base | Representation |
---|---|
bin | 101111101111111101111011… |
… | …110000000110010010010110 |
3 | 1000112120020022211102221010102 |
4 | 233233331323300012102112 |
5 | 210011203210022103100 |
6 | 2022350423023054102 |
7 | 62143216222402610 |
oct | 5757757360062226 |
9 | 1015506284387112 |
10 | 210004502144150 |
11 | 60a0645572195a |
12 | 1b678342a41332 |
13 | 9024455091b0c |
14 | 39c03b4a59db0 |
15 | 1942a74395cd5 |
hex | beff7bc06496 |
210004502144150 has 96 divisors (see below), whose sum is σ = 447318804049920. Its totient is φ = 71855000064000.
The previous prime is 210004502144111. The next prime is 210004502144153. The reversal of 210004502144150 is 51441205400012.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210004502144153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 473381141 + ... + 473824559.
It is an arithmetic number, because the mean of its divisors is an integer number (4659570875520).
Almost surely, 2210004502144150 is an apocalyptic number.
210004502144150 is an abundant number, since it is smaller than the sum of its proper divisors (237314301905770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210004502144150 is a wasteful number, since it uses less digits than its factorization.
210004502144150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 446190 (or 446185 counting only the distinct ones).
The product of its (nonzero) digits is 6400, while the sum is 29.
Adding to 210004502144150 its reverse (51441205400012), we get a palindrome (261445707544162).
The spelling of 210004502144150 in words is "two hundred ten trillion, four billion, five hundred two million, one hundred forty-four thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •