Base | Representation |
---|---|
bin | 100000100101101011000011… |
… | …010111011010000011001010 |
3 | 200210110212022210221120210020 |
4 | 200211223003113122003022 |
5 | 122241224314102020100 |
6 | 1224455113203201310 |
7 | 42121662140610222 |
oct | 4045530327320312 |
9 | 623425283846706 |
10 | 143326336360650 |
11 | 417393a3402833 |
12 | 140a9730076236 |
13 | 61c8800401851 |
14 | 2757062d77082 |
15 | 11883a85855a0 |
hex | 825ac35da0ca |
143326336360650 has 48 divisors (see below), whose sum is σ = 355451710658304. Its totient is φ = 38220098676480.
The previous prime is 143326336360607. The next prime is 143326336360661. The reversal of 143326336360650 is 56063633623341.
It is a junction number, because it is equal to n+sod(n) for n = 143326336360593 and 143326336360602.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19640322 + ... + 25930578.
It is an arithmetic number, because the mean of its divisors is an integer number (7405243972048).
Almost surely, 2143326336360650 is an apocalyptic number.
143326336360650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
143326336360650 is an abundant number, since it is smaller than the sum of its proper divisors (212125374297654).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143326336360650 is a wasteful number, since it uses less digits than its factorization.
143326336360650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6442175 (or 6442170 counting only the distinct ones).
The product of its (nonzero) digits is 12597120, while the sum is 51.
Adding to 143326336360650 its reverse (56063633623341), we get a palindrome (199389969983991).
The spelling of 143326336360650 in words is "one hundred forty-three trillion, three hundred twenty-six billion, three hundred thirty-six million, three hundred sixty thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •