Base | Representation |
---|---|
bin | 100000100110010000001011… |
… | …011100001000111110000110 |
3 | 200210121200012222220211101110 |
4 | 200212100023130020332012 |
5 | 122242402434232013010 |
6 | 1224525305001105450 |
7 | 42124603043326365 |
oct | 4046201334107606 |
9 | 623550188824343 |
10 | 143366200266630 |
11 | 4175429a557380 |
12 | 140b53b6488286 |
13 | 61cc4b42138b3 |
14 | 2758d654397dc |
15 | 118943d138120 |
hex | 82640b708f86 |
143366200266630 has 32 divisors (see below), whose sum is σ = 375358778880768. Its totient is φ = 34755442488800.
The previous prime is 143366200266613. The next prime is 143366200266713. The reversal of 143366200266630 is 36662002663341.
It is a self number, because there is not a number n which added to its sum of digits gives 143366200266630.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 217221515226 + ... + 217221515885.
It is an arithmetic number, because the mean of its divisors is an integer number (11729961840024).
Almost surely, 2143366200266630 is an apocalyptic number.
143366200266630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
143366200266630 is an abundant number, since it is smaller than the sum of its proper divisors (231992578614138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143366200266630 is a wasteful number, since it uses less digits than its factorization.
143366200266630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 434443031132.
The product of its (nonzero) digits is 3359232, while the sum is 48.
The spelling of 143366200266630 in words is "one hundred forty-three trillion, three hundred sixty-six billion, two hundred million, two hundred sixty-six thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •