Base | Representation |
---|---|
bin | 1000010010010111100… |
… | …1110111011100001010 |
3 | 111121110222222120202011 |
4 | 2010211321313130022 |
5 | 4313033140101200 |
6 | 145223115530134 |
7 | 13200025506244 |
oct | 2044571673412 |
9 | 447428876664 |
10 | 142369847050 |
11 | 55419081322 |
12 | 2371345994a |
13 | 1056b851162 |
14 | 6c6827d094 |
15 | 3a83cdd5ba |
hex | 2125e7770a |
142369847050 has 24 divisors (see below), whose sum is σ = 276321305376. Its totient is φ = 54471941040.
The previous prime is 142369847047. The next prime is 142369847099. The reversal of 142369847050 is 50748963241.
It is a happy number.
142369847050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 142369846985 and 142369847003.
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 11 ways as a sum of consecutive naturals, for example, 61898784 + ... + 61901083.
It is an arithmetic number, because the mean of its divisors is an integer number (11513387724).
It is a 1-persistent number, because it is pandigital, but 2⋅142369847050 = 284739694100 is not.
Almost surely, 2142369847050 is an apocalyptic number.
142369847050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
142369847050 is a deficient number, since it is larger than the sum of its proper divisors (133951458326).
142369847050 is a wasteful number, since it uses less digits than its factorization.
142369847050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123799902 (or 123799897 counting only the distinct ones).
The product of its (nonzero) digits is 1451520, while the sum is 49.
The spelling of 142369847050 in words is "one hundred forty-two billion, three hundred sixty-nine million, eight hundred forty-seven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •