Base | Representation |
---|---|
bin | 1000010010010101110… |
… | …0111000101111111000 |
3 | 111121110110200121212112 |
4 | 2010211130320233320 |
5 | 4313024214001412 |
6 | 145222245031452 |
7 | 13166604106136 |
oct | 2044534705770 |
9 | 447413617775 |
10 | 142362250232 |
11 | 55414862764 |
12 | 237109b5588 |
13 | 1056a0c13b7 |
14 | 6c67262756 |
15 | 3a832dc722 |
hex | 2125738bf8 |
142362250232 has 8 divisors (see below), whose sum is σ = 266929219200. Its totient is φ = 71181125112.
The previous prime is 142362250231. The next prime is 142362250253. The reversal of 142362250232 is 232052263241.
142362250232 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×1423622502322 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142362250231) 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 as a sum of consecutive naturals, namely, 8897640632 + ... + 8897640647.
It is an arithmetic number, because the mean of its divisors is an integer number (33366152400).
Almost surely, 2142362250232 is an apocalyptic number.
It is an amenable number.
142362250232 is a deficient number, since it is larger than the sum of its proper divisors (124566968968).
142362250232 is a wasteful number, since it uses less digits than its factorization.
142362250232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17795281285 (or 17795281281 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 32.
The spelling of 142362250232 in words is "one hundred forty-two billion, three hundred sixty-two million, two hundred fifty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •