Base | Representation |
---|---|
bin | 1000010100110111011… |
… | …0010110001110100101 |
3 | 111200012201000112220110 |
4 | 2011031312112032211 |
5 | 4320421220410341 |
6 | 145413415523233 |
7 | 13222444023420 |
oct | 2051566261645 |
9 | 450181015813 |
10 | 143040013221 |
11 | 557323a4066 |
12 | 2387b989519 |
13 | 106476460a1 |
14 | 6ccd28c9b7 |
15 | 3ac2a6b216 |
hex | 214dd963a5 |
143040013221 has 32 divisors (see below), whose sum is σ = 225511292160. Its totient is φ = 78908304384.
The previous prime is 143040013213. The next prime is 143040013243. The reversal of 143040013221 is 122310040341.
143040013221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 143040013221 - 23 = 143040013213 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143040013271) 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 31 ways as a sum of consecutive naturals, for example, 8696221 + ... + 8712653.
It is an arithmetic number, because the mean of its divisors is an integer number (7047227880).
Almost surely, 2143040013221 is an apocalyptic number.
It is an amenable number.
143040013221 is a deficient number, since it is larger than the sum of its proper divisors (82471278939).
143040013221 is a wasteful number, since it uses less digits than its factorization.
143040013221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30765.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 143040013221 its reverse (122310040341), we get a palindrome (265350053562).
The spelling of 143040013221 in words is "one hundred forty-three billion, forty million, thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.203 sec. • engine limits •