Base | Representation |
---|---|
bin | 100001000001111010110111… |
… | …111110100110011000110111 |
3 | 201001100102201210100012101102 |
4 | 201001322313332212120313 |
5 | 123020030234423313012 |
6 | 1232542542113120315 |
7 | 42412141225021154 |
oct | 4101726776463067 |
9 | 631312653305342 |
10 | 145267470526007 |
11 | 42317651aa67a5 |
12 | 14361985b5909b |
13 | 630988218c5ab |
14 | 27c2da984722b |
15 | 11bdb186942c2 |
hex | 841eb7fa6637 |
145267470526007 has 4 divisors (see below), whose sum is σ = 145267704424320. Its totient is φ = 145267236627696.
The previous prime is 145267470525959. The next prime is 145267470526019. The reversal of 145267470526007 is 700625074762541.
It is a happy number.
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 145267470526007 - 240 = 144167958898231 is a prime.
It is a super-2 number, since 2×1452674705260072 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145267470126007) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 116015063 + ... + 117260520.
It is an arithmetic number, because the mean of its divisors is an integer number (36316926106080).
Almost surely, 2145267470526007 is an apocalyptic number.
145267470526007 is a deficient number, since it is larger than the sum of its proper divisors (233898313).
145267470526007 is an equidigital number, since it uses as much as digits as its factorization.
145267470526007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233898312.
The product of its (nonzero) digits is 19756800, while the sum is 56.
The spelling of 145267470526007 in words is "one hundred forty-five trillion, two hundred sixty-seven billion, four hundred seventy million, five hundred twenty-six thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •