Base | Representation |
---|---|
bin | 101101100000011110000110… |
… | …111000111111011001111100 |
3 | 222020122112012202001000012002 |
4 | 231200132012320333121330 |
5 | 202213122233143104040 |
6 | 1545400343502401432 |
7 | 60104613060206612 |
oct | 5540360670773174 |
9 | 866575182030162 |
10 | 200143444113020 |
11 | 588543a3522591 |
12 | 1a545182590278 |
13 | 878a5a4550675 |
14 | 375cdcc8236b2 |
15 | 18212cc32da15 |
hex | b60786e3f67c |
200143444113020 has 24 divisors (see below), whose sum is σ = 420301511317968. Its totient is φ = 80057324563200.
The previous prime is 200143444112999. The next prime is 200143444113023. The reversal of 200143444113020 is 20311444341002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200143444113023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44199140 + ... + 48516500.
It is an arithmetic number, because the mean of its divisors is an integer number (17512562971582).
Almost surely, 2200143444113020 is an apocalyptic number.
200143444113020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200143444113020 is an abundant number, since it is smaller than the sum of its proper divisors (220158067204948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200143444113020 is a wasteful number, since it uses less digits than its factorization.
200143444113020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6635261 (or 6635259 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 200143444113020 its reverse (20311444341002), we get a palindrome (220454888454022).
The spelling of 200143444113020 in words is "two hundred trillion, one hundred forty-three billion, four hundred forty-four million, one hundred thirteen thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •