Base | Representation |
---|---|
bin | 100000100010100001101011… |
… | …010001011101010100111001 |
3 | 200202201012012121222110211211 |
4 | 200202201223101131110321 |
5 | 122224204001132311101 |
6 | 1224211513230523121 |
7 | 42100235636330056 |
oct | 4042415321352471 |
9 | 622635177873754 |
10 | 143110110041401 |
11 | 41665725277838 |
12 | 140738463664a1 |
13 | 61b12c1488649 |
14 | 274a7cdc5002d |
15 | 1182950812c51 |
hex | 82286b45d539 |
143110110041401 has 4 divisors (see below), whose sum is σ = 143125188557904. Its totient is φ = 143095031524900.
The previous prime is 143110110041387. The next prime is 143110110041413. The reversal of 143110110041401 is 104140011011341.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 143110110041401 - 225 = 143110076486969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (143110110041461) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7539244015 + ... + 7539262996.
It is an arithmetic number, because the mean of its divisors is an integer number (35781297139476).
Almost surely, 2143110110041401 is an apocalyptic number.
It is an amenable number.
143110110041401 is a deficient number, since it is larger than the sum of its proper divisors (15078516503).
143110110041401 is an equidigital number, since it uses as much as digits as its factorization.
143110110041401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15078516502.
The product of its (nonzero) digits is 192, while the sum is 22.
Adding to 143110110041401 its reverse (104140011011341), we get a palindrome (247250121052742).
The spelling of 143110110041401 in words is "one hundred forty-three trillion, one hundred ten billion, one hundred ten million, forty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •