Base | Representation |
---|---|
bin | 100000100111010111001010… |
… | …101111110101110101001000 |
3 | 200210212221222011221010001011 |
4 | 200213113022233311311020 |
5 | 122300130041111322100 |
6 | 1225024312351133304 |
7 | 42133241665165216 |
oct | 4047271257656510 |
9 | 623787864833034 |
10 | 143442424323400 |
11 | 41783654aa3414 |
12 | 14108129814234 |
13 | 6206740c85077 |
14 | 275c916905cb6 |
15 | 118b3eed8dbba |
hex | 8275cabf5d48 |
143442424323400 has 48 divisors (see below), whose sum is σ = 337521752694000. Its totient is φ = 56685680930880.
The previous prime is 143442424323389. The next prime is 143442424323433. The reversal of 143442424323400 is 4323424244341.
It is a Harshad number since it is a multiple of its sum of digits (40).
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, 4320538350 + ... + 4320571549.
It is an arithmetic number, because the mean of its divisors is an integer number (7031703181125).
Almost surely, 2143442424323400 is an apocalyptic number.
143442424323400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
143442424323400 is an abundant number, since it is smaller than the sum of its proper divisors (194079328370600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143442424323400 is a wasteful number, since it uses less digits than its factorization.
143442424323400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8641109998 (or 8641109989 counting only the distinct ones).
The product of its (nonzero) digits is 884736, while the sum is 40.
Adding to 143442424323400 its reverse (4323424244341), we get a palindrome (147765848567741).
The spelling of 143442424323400 in words is "one hundred forty-three trillion, four hundred forty-two billion, four hundred twenty-four million, three hundred twenty-three thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •