Base | Representation |
---|---|
bin | 1000011100101110100… |
… | …0111101011101001101 |
3 | 111212122210010222201201 |
4 | 2013023220331131031 |
5 | 4334232002324401 |
6 | 150403045305501 |
7 | 13325651216152 |
oct | 2071350753515 |
9 | 455583128651 |
10 | 145150433101 |
11 | 566156a9823 |
12 | 2416a705291 |
13 | 108c294194b |
14 | 704d68c229 |
15 | 3b97e90b01 |
hex | 21cba3d74d |
145150433101 has 16 divisors (see below), whose sum is σ = 157214183040. Its totient is φ = 133580491200.
The previous prime is 145150433093. The next prime is 145150433143. The reversal of 145150433101 is 101334051541.
It is a cyclic number.
It is not a de Polignac number, because 145150433101 - 23 = 145150433093 is a prime.
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 145150433101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145150433201) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 611865 + ... + 815278.
It is an arithmetic number, because the mean of its divisors is an integer number (9825886440).
Almost surely, 2145150433101 is an apocalyptic number.
It is an amenable number.
145150433101 is a deficient number, since it is larger than the sum of its proper divisors (12063749939).
145150433101 is a wasteful number, since it uses less digits than its factorization.
145150433101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1427316.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 145150433101 its reverse (101334051541), we get a palindrome (246484484642).
The spelling of 145150433101 in words is "one hundred forty-five billion, one hundred fifty million, four hundred thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •