Base | Representation |
---|---|
bin | 1000011111001110001… |
… | …1101110000101000101 |
3 | 111221101110100000220121 |
4 | 2013303203232011011 |
5 | 4342114424214122 |
6 | 150553331501541 |
7 | 13351362543634 |
oct | 2076343560505 |
9 | 457343300817 |
10 | 145820148037 |
11 | 56929743543 |
12 | 24316a578b1 |
13 | 1099b609385 |
14 | 70b45c151b |
15 | 3bd6b7ebc7 |
hex | 21f38ee145 |
145820148037 has 16 divisors (see below), whose sum is σ = 147695184000. Its totient is φ = 143960224320.
The previous prime is 145820148029. The next prime is 145820148109. The reversal of 145820148037 is 730841028541.
145820148037 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 145820148037 - 23 = 145820148029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 145820147984 and 145820148002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145820148937) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16816539 + ... + 16825207.
It is an arithmetic number, because the mean of its divisors is an integer number (9230949000).
Almost surely, 2145820148037 is an apocalyptic number.
It is an amenable number.
145820148037 is a deficient number, since it is larger than the sum of its proper divisors (1875035963).
145820148037 is a wasteful number, since it uses less digits than its factorization.
145820148037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9516.
The product of its (nonzero) digits is 215040, while the sum is 43.
The spelling of 145820148037 in words is "one hundred forty-five billion, eight hundred twenty million, one hundred forty-eight thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •