Base | Representation |
---|---|
bin | 100000100111000011010100… |
… | …100100100110100111110000 |
3 | 200210210220222001101102122010 |
4 | 200213003110210212213300 |
5 | 122244302420231010300 |
6 | 1225010430023442520 |
7 | 42131555625116463 |
oct | 4047032444464760 |
9 | 623726861342563 |
10 | 143421114313200 |
11 | 4177560a05a339 |
12 | 14103b80bb6440 |
13 | 6204726079089 |
14 | 275b8946552da |
15 | 118aaa4106a50 |
hex | 8270d49269f0 |
143421114313200 has 60 divisors (see below), whose sum is σ = 459425636187128. Its totient is φ = 38245630483200.
The previous prime is 143421114313123. The next prime is 143421114313229. The reversal of 143421114313200 is 2313411124341.
It is a tau number, because it is divible by the number of its divisors (60).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 59758796431 + ... + 59758798830.
Almost surely, 2143421114313200 is an apocalyptic number.
143421114313200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
143421114313200 is an abundant number, since it is smaller than the sum of its proper divisors (316004521873928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143421114313200 is a wasteful number, since it uses less digits than its factorization.
143421114313200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 119517595282 (or 119517595271 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 30.
Adding to 143421114313200 its reverse (2313411124341), we get a palindrome (145734525437541).
The spelling of 143421114313200 in words is "one hundred forty-three trillion, four hundred twenty-one billion, one hundred fourteen million, three hundred thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •