Base | Representation |
---|---|
bin | 1000010001111010111… |
… | …1101100001011001001 |
3 | 111121011121222110102010 |
4 | 2010132233230023021 |
5 | 4312311413121303 |
6 | 145203145330133 |
7 | 13164036555000 |
oct | 2043657541311 |
9 | 447147873363 |
10 | 142249738953 |
11 | 553672a6333 |
12 | 2369b196949 |
13 | 1054c9b9c8a |
14 | 6c56335c37 |
15 | 3a784b5c03 |
hex | 211ebec2c9 |
142249738953 has 64 divisors (see below), whose sum is σ = 227062784000. Its totient is φ = 79153925760.
The previous prime is 142249738931. The next prime is 142249738987. The reversal of 142249738953 is 359837942241.
142249738953 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 142249738953 - 26 = 142249738889 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 142249738893 and 142249738902.
It is not an unprimeable number, because it can be changed into a prime (142249738903) 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 63 ways as a sum of consecutive naturals, for example, 5922258 + ... + 5946228.
It is an arithmetic number, because the mean of its divisors is an integer number (3547856000).
Almost surely, 2142249738953 is an apocalyptic number.
It is an amenable number.
142249738953 is a deficient number, since it is larger than the sum of its proper divisors (84813045047).
142249738953 is an equidigital number, since it uses as much as digits as its factorization.
142249738953 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24147 (or 24133 counting only the distinct ones).
The product of its digits is 13063680, while the sum is 57.
The spelling of 142249738953 in words is "one hundred forty-two billion, two hundred forty-nine million, seven hundred thirty-eight thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •