Base | Representation |
---|---|
bin | 1000010010011110110… |
… | …1000011110110010011 |
3 | 111121120002210202202211 |
4 | 2010213231003312103 |
5 | 4313113402410220 |
6 | 145230115052551 |
7 | 13200543256255 |
oct | 2044755036623 |
9 | 447502722684 |
10 | 142400044435 |
11 | 55434127040 |
12 | 237215a1157 |
13 | 10574b94c2c |
14 | 6c6c29dcd5 |
15 | 3a867a5b5a |
hex | 2127b43d93 |
142400044435 has 16 divisors (see below), whose sum is σ = 186565391712. Its totient is φ = 103479897600.
The previous prime is 142400044433. The next prime is 142400044441. The reversal of 142400044435 is 534440004241.
142400044435 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 142400044435 - 21 = 142400044433 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 142400044397 and 142400044406.
It is not an unprimeable number, because it can be changed into a prime (142400044433) 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 15 ways as a sum of consecutive naturals, for example, 978486 + ... + 1114555.
It is an arithmetic number, because the mean of its divisors is an integer number (11660336982).
Almost surely, 2142400044435 is an apocalyptic number.
142400044435 is a deficient number, since it is larger than the sum of its proper divisors (44165347277).
142400044435 is a wasteful number, since it uses less digits than its factorization.
142400044435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2094294.
The product of its (nonzero) digits is 30720, while the sum is 31.
Adding to 142400044435 its reverse (534440004241), we get a palindrome (676840048676).
The spelling of 142400044435 in words is "one hundred forty-two billion, four hundred million, forty-four thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •