Base | Representation |
---|---|
bin | 100000100010100100011001… |
… | …010101000001001011111100 |
3 | 200202201110202010210102111111 |
4 | 200202210121111001023330 |
5 | 122224230441213212200 |
6 | 1224213115104131404 |
7 | 42100401205342033 |
oct | 4042443125011374 |
9 | 622643663712444 |
10 | 143113030210300 |
11 | 41666993671967 |
12 | 14074320306b64 |
13 | 61b166846b637 |
14 | 274a9c99d571a |
15 | 1182a71d880ba |
hex | 8229195412fc |
143113030210300 has 36 divisors (see below), whose sum is σ = 310993294434760. Its totient is φ = 57164471277120.
The previous prime is 143113030210273. The next prime is 143113030210301. The reversal of 143113030210300 is 3012030311341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143113030210301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1009188834 + ... + 1009330633.
Almost surely, 2143113030210300 is an apocalyptic number.
143113030210300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
143113030210300 is an abundant number, since it is smaller than the sum of its proper divisors (167880264224460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143113030210300 is a wasteful number, since it uses less digits than its factorization.
143113030210300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2018520190 (or 2018520183 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 143113030210300 its reverse (3012030311341), we get a palindrome (146125060521641).
The spelling of 143113030210300 in words is "one hundred forty-three trillion, one hundred thirteen billion, thirty million, two hundred ten thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •