Base | Representation |
---|---|
bin | 1000011100100001011… |
… | …0010100101010111111 |
3 | 111212111221020122211202 |
4 | 2013020112110222333 |
5 | 4334123333401212 |
6 | 150353354010115 |
7 | 13324410661613 |
oct | 2071026245277 |
9 | 455457218752 |
10 | 145095215807 |
11 | 565975151a3 |
12 | 2415411693b |
13 | 108b437a8a9 |
14 | 70461d7343 |
15 | 3b931d50c2 |
hex | 21c8594abf |
145095215807 has 2 divisors, whose sum is σ = 145095215808. Its totient is φ = 145095215806.
The previous prime is 145095215773. The next prime is 145095215809. The reversal of 145095215807 is 708512590541.
It is a happy number.
145095215807 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145095215807 is a prime.
It is a super-2 number, since 2×1450952158072 (a number of 23 digits) contains 22 as substring.
Together with 145095215809, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145095215809) 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 as a sum of consecutive naturals, namely, 72547607903 + 72547607904.
It is an arithmetic number, because the mean of its divisors is an integer number (72547607904).
Almost surely, 2145095215807 is an apocalyptic number.
145095215807 is a deficient number, since it is larger than the sum of its proper divisors (1).
145095215807 is an equidigital number, since it uses as much as digits as its factorization.
145095215807 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504000, while the sum is 47.
The spelling of 145095215807 in words is "one hundred forty-five billion, ninety-five million, two hundred fifteen thousand, eight hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •