Base | Representation |
---|---|
bin | 1000010100110101100… |
… | …1111001011110001001 |
3 | 111200012011222122200220 |
4 | 2011031121321132021 |
5 | 4320412313233101 |
6 | 145412552020253 |
7 | 13222323442461 |
oct | 2051531713611 |
9 | 450164878626 |
10 | 143032555401 |
11 | 5572916a97a |
12 | 23879391689 |
13 | 10645c34688 |
14 | 6ccc2aaba1 |
15 | 3ac2096636 |
hex | 214d679789 |
143032555401 has 8 divisors (see below), whose sum is σ = 191550207264. Its totient is φ = 94934970240.
The previous prime is 143032555381. The next prime is 143032555409. The reversal of 143032555401 is 104555230341.
143032555401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 143032555401 - 234 = 125852686217 is a prime.
It is not an unprimeable number, because it can be changed into a prime (143032555409) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 105015880 + ... + 105017241.
It is an arithmetic number, because the mean of its divisors is an integer number (23943775908).
Almost surely, 2143032555401 is an apocalyptic number.
It is an amenable number.
143032555401 is a deficient number, since it is larger than the sum of its proper divisors (48517651863).
143032555401 is a wasteful number, since it uses less digits than its factorization.
143032555401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210033351.
The product of its (nonzero) digits is 36000, while the sum is 33.
Adding to 143032555401 its reverse (104555230341), we get a palindrome (247587785742).
The spelling of 143032555401 in words is "one hundred forty-three billion, thirty-two million, five hundred fifty-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •