Base | Representation |
---|---|
bin | 1000010001011000001… |
… | …1110111001101111001 |
3 | 111120210110210210012210 |
4 | 2010112003313031321 |
5 | 4312012113011441 |
6 | 145140502325333 |
7 | 13160320225512 |
oct | 2042603671571 |
9 | 446713723183 |
10 | 142104032121 |
11 | 552a2026667 |
12 | 2365a429849 |
13 | 1052876220c |
14 | 6c40c47a09 |
15 | 3a6a7d3616 |
hex | 21160f7379 |
142104032121 has 32 divisors (see below), whose sum is σ = 203453175168. Its totient is φ = 87904051200.
The previous prime is 142104032107. The next prime is 142104032137. The reversal of 142104032121 is 121230401241.
142104032121 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 142104032121 - 233 = 133514097529 is a prime.
It is a super-3 number, since 3×1421040321213 (a number of 34 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (142104030121) 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, 10421310 + ... + 10434936.
It is an arithmetic number, because the mean of its divisors is an integer number (6357911724).
Almost surely, 2142104032121 is an apocalyptic number.
It is an amenable number.
142104032121 is a deficient number, since it is larger than the sum of its proper divisors (61349143047).
142104032121 is a wasteful number, since it uses less digits than its factorization.
142104032121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16521.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 142104032121 its reverse (121230401241), we get a palindrome (263334433362).
The spelling of 142104032121 in words is "one hundred forty-two billion, one hundred four million, thirty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •