Base | Representation |
---|---|
bin | 1000010010011111011… |
… | …1011110000000111010 |
3 | 111121120021221101201122 |
4 | 2010213313132000322 |
5 | 4313120102214200 |
6 | 145230253345242 |
7 | 13200605412356 |
oct | 2044767360072 |
9 | 447507841648 |
10 | 142402773050 |
11 | 5543572009a |
12 | 23722498222 |
13 | 1057560bbb5 |
14 | 6c6c7b0466 |
15 | 3a86b44385 |
hex | 2127dde03a |
142402773050 has 48 divisors (see below), whose sum is σ = 274460167800. Its totient is φ = 54905088000.
The previous prime is 142402773043. The next prime is 142402773169. The reversal of 142402773050 is 50377204241.
142402773050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 12 ways, for example, as 4851540409 + 137551232641 = 69653^2 + 370879^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 142402773050.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 789746 + ... + 953154.
Almost surely, 2142402773050 is an apocalyptic number.
142402773050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
142402773050 is a deficient number, since it is larger than the sum of its proper divisors (132057394750).
142402773050 is a wasteful number, since it uses less digits than its factorization.
142402773050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164051 (or 164046 counting only the distinct ones).
The product of its (nonzero) digits is 47040, while the sum is 35.
Adding to 142402773050 its reverse (50377204241), we get a palindrome (192779977291).
The spelling of 142402773050 in words is "one hundred forty-two billion, four hundred two million, seven hundred seventy-three thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •