Base | Representation |
---|---|
bin | 1000011111101001011… |
… | …0011101110011110101 |
3 | 111221200101210002212120 |
4 | 2013322112131303311 |
5 | 4342333113122122 |
6 | 151012522310153 |
7 | 13354245334215 |
oct | 2077226356365 |
9 | 457611702776 |
10 | 145934114037 |
11 | 56988003918 |
12 | 24349058359 |
13 | 109b90cc98a |
14 | 70c57aa245 |
15 | 3be1b9275c |
hex | 21fa59dcf5 |
145934114037 has 4 divisors (see below), whose sum is σ = 194578818720. Its totient is φ = 97289409356.
The previous prime is 145934114009. The next prime is 145934114057. The reversal of 145934114037 is 730411439541.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 145934114037 - 211 = 145934111989 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 145934114037.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145934114057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24322352337 + ... + 24322352342.
It is an arithmetic number, because the mean of its divisors is an integer number (48644704680).
Almost surely, 2145934114037 is an apocalyptic number.
It is an amenable number.
145934114037 is a deficient number, since it is larger than the sum of its proper divisors (48644704683).
145934114037 is an equidigital number, since it uses as much as digits as its factorization.
145934114037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48644704682.
The product of its (nonzero) digits is 181440, while the sum is 42.
The spelling of 145934114037 in words is "one hundred forty-five billion, nine hundred thirty-four million, one hundred fourteen thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •