Base | Representation |
---|---|
bin | 1000011100010100001… |
… | …1111000011111100111 |
3 | 111212101002102221210022 |
4 | 2013011003320133213 |
5 | 4334020223101101 |
6 | 150344103345355 |
7 | 13323141041033 |
oct | 2070503703747 |
9 | 455332387708 |
10 | 145040050151 |
11 | 56569366447 |
12 | 2413975225b |
13 | 108a5b041a9 |
14 | 703cb571c3 |
15 | 3b8d439a1b |
hex | 21c50f87e7 |
145040050151 has 8 divisors (see below), whose sum is σ = 151625904864. Its totient is φ = 138477509280.
The previous prime is 145040050147. The next prime is 145040050157. The reversal of 145040050151 is 151050040541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 145040050151 - 22 = 145040050147 is a prime.
It is a super-2 number, since 2×1450400501512 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 145040050151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145040050157) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5815736 + ... + 5840621.
It is an arithmetic number, because the mean of its divisors is an integer number (18953238108).
Almost surely, 2145040050151 is an apocalyptic number.
145040050151 is a deficient number, since it is larger than the sum of its proper divisors (6585854713).
145040050151 is a wasteful number, since it uses less digits than its factorization.
145040050151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11656921.
The product of its (nonzero) digits is 2000, while the sum is 26.
Adding to 145040050151 its reverse (151050040541), we get a palindrome (296090090692).
The spelling of 145040050151 in words is "one hundred forty-five billion, forty million, fifty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •