Base | Representation |
---|---|
bin | 100000100101011100111001… |
… | …100111110110000111100110 |
3 | 200210102102002210021111120111 |
4 | 200211130321213312013212 |
5 | 122241002203432342410 |
6 | 1224444121251323234 |
7 | 42120613442204155 |
oct | 4045347147660746 |
9 | 623372083244514 |
10 | 143311140512230 |
11 | 41732a05783a19 |
12 | 140a67aabb051a |
13 | 61c724b123072 |
14 | 2756420b3159c |
15 | 1187cb9486b8a |
hex | 8257399f61e6 |
143311140512230 has 32 divisors (see below), whose sum is σ = 264261219925248. Its totient is φ = 55924296960000.
The previous prime is 143311140512227. The next prime is 143311140512249. The reversal of 143311140512230 is 32215041113341.
It is a happy number.
It is a super-2 number, since 2×1433111405122302 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 143311140512192 and 143311140512201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5238859 + ... + 17721961.
It is an arithmetic number, because the mean of its divisors is an integer number (8258163122664).
Almost surely, 2143311140512230 is an apocalyptic number.
143311140512230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
143311140512230 is a deficient number, since it is larger than the sum of its proper divisors (120950079413018).
143311140512230 is a wasteful number, since it uses less digits than its factorization.
143311140512230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12511152.
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 143311140512230 its reverse (32215041113341), we get a palindrome (175526181625571).
The spelling of 143311140512230 in words is "one hundred forty-three trillion, three hundred eleven billion, one hundred forty million, five hundred twelve thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •