Base | Representation |
---|---|
bin | 1000011110011111100… |
… | …0110010110111010111 |
3 | 111220212210220021002221 |
4 | 2013213320302313113 |
5 | 4341214313033241 |
6 | 150522055043211 |
7 | 13343464342501 |
oct | 2074770626727 |
9 | 456783807087 |
10 | 145624346071 |
11 | 56839168636 |
12 | 24281370507 |
13 | 10969b91b19 |
14 | 70965b2d71 |
15 | 3bc48a45d1 |
hex | 21e7e32dd7 |
145624346071 has 4 divisors (see below), whose sum is σ = 145960661392. Its totient is φ = 145288030752.
The previous prime is 145624346059. The next prime is 145624346099. The reversal of 145624346071 is 170643426541.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 145624346071 - 27 = 145624345943 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145624346041) 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, 168157011 + ... + 168157876.
It is an arithmetic number, because the mean of its divisors is an integer number (36490165348).
Almost surely, 2145624346071 is an apocalyptic number.
145624346071 is a deficient number, since it is larger than the sum of its proper divisors (336315321).
145624346071 is an equidigital number, since it uses as much as digits as its factorization.
145624346071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336315320.
The product of its (nonzero) digits is 483840, while the sum is 43.
The spelling of 145624346071 in words is "one hundred forty-five billion, six hundred twenty-four million, three hundred forty-six thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •