Base | Representation |
---|---|
bin | 1000011100011001001… |
… | …1110011110001100110 |
3 | 111212102112212102210101 |
4 | 2013012103303301212 |
5 | 4334041104033332 |
6 | 150350132414314 |
7 | 13323514114114 |
oct | 2070623636146 |
9 | 455375772711 |
10 | 145061002342 |
11 | 5657a177103 |
12 | 2414477739a |
13 | 108aa25bb39 |
14 | 704184cab4 |
15 | 3b901c7ae7 |
hex | 21c64f3c66 |
145061002342 has 8 divisors (see below), whose sum is σ = 217681760232. Its totient is φ = 72500415600.
The previous prime is 145061002337. The next prime is 145061002349. The reversal of 145061002342 is 243200160541.
145061002342 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 145061002342.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145061002349) 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 3 ways as a sum of consecutive naturals, for example, 15036759 + ... + 15046402.
It is an arithmetic number, because the mean of its divisors is an integer number (27210220029).
Almost surely, 2145061002342 is an apocalyptic number.
145061002342 is a deficient number, since it is larger than the sum of its proper divisors (72620757890).
145061002342 is a wasteful number, since it uses less digits than its factorization.
145061002342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30085574.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 145061002342 its reverse (243200160541), we get a palindrome (388261162883).
The spelling of 145061002342 in words is "one hundred forty-five billion, sixty-one million, two thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •