Base | Representation |
---|---|
bin | 1000011100010110101… |
… | …1111110101001001101 |
3 | 111212101211012222002202 |
4 | 2013011223332221031 |
5 | 4334030420423401 |
6 | 150345120531245 |
7 | 13323326266145 |
oct | 2070553765115 |
9 | 455354188082 |
10 | 145050561101 |
11 | 56574295486 |
12 | 24141180b25 |
13 | 108a80444a4 |
14 | 70402d1925 |
15 | 3b8e31406b |
hex | 21c5afea4d |
145050561101 has 8 divisors (see below), whose sum is σ = 145686812544. Its totient is φ = 144414427360.
The previous prime is 145050561091. The next prime is 145050561143. The reversal of 145050561101 is 101165050541.
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 145050561101 - 230 = 143976819277 is a prime.
It is a super-3 number, since 3×1450505611013 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145050561301) 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, 3223580 + ... + 3268266.
It is an arithmetic number, because the mean of its divisors is an integer number (18210851568).
Almost surely, 2145050561101 is an apocalyptic number.
It is an amenable number.
145050561101 is a deficient number, since it is larger than the sum of its proper divisors (636251443).
145050561101 is a wasteful number, since it uses less digits than its factorization.
145050561101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58851.
The product of its (nonzero) digits is 3000, while the sum is 29.
The spelling of 145050561101 in words is "one hundred forty-five billion, fifty million, five hundred sixty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.098 sec. • engine limits •