Base | Representation |
---|---|
bin | 10001000001001… |
… | …11110100101000 |
3 | 100221122102212100 |
4 | 20200213310220 |
5 | 243022110243 |
6 | 22100013400 |
7 | 3352343313 |
oct | 1040476450 |
9 | 327572770 |
10 | 142769448 |
11 | 73653888 |
12 | 3b991260 |
13 | 23769a83 |
14 | 14d6597a |
15 | c8020d3 |
hex | 8827d28 |
142769448 has 24 divisors (see below), whose sum is σ = 386667450. Its totient is φ = 47589792.
The previous prime is 142769423. The next prime is 142769449. The reversal of 142769448 is 844967241.
142769448 is a `hidden beast` number, since 142 + 7 + 69 + 448 = 666.
It can be written as a sum of positive squares in only one way, i.e., 117548964 + 25220484 = 10842^2 + 5022^2 .
It is a tau number, because it is divible by the number of its divisors (24).
It is not an unprimeable number, because it can be changed into a prime (142769449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 991383 + ... + 991526.
Almost surely, 2142769448 is an apocalyptic number.
142769448 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
142769448 is an abundant number, since it is smaller than the sum of its proper divisors (243898002).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142769448 is a wasteful number, since it uses less digits than its factorization.
142769448 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1982921 (or 1982914 counting only the distinct ones).
The product of its digits is 387072, while the sum is 45.
The square root of 142769448 is about 11948.6169910998. The cubic root of 142769448 is about 522.6509692489.
The spelling of 142769448 in words is "one hundred forty-two million, seven hundred sixty-nine thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •