Base | Representation |
---|---|
bin | 1000011100111011111… |
… | …0111011010111001101 |
3 | 111212210200200200002000 |
4 | 2013032332323113031 |
5 | 4334340332221331 |
6 | 150412411422513 |
7 | 13330232040435 |
oct | 2071676732715 |
9 | 455720620060 |
10 | 145206523341 |
11 | 5664432a1a0 |
12 | 24185454a39 |
13 | 10901450139 |
14 | 7056ccd2c5 |
15 | 3b9cd700e6 |
hex | 21cefbb5cd |
145206523341 has 16 divisors (see below), whose sum is σ = 234677209920. Its totient is φ = 88003953360.
The previous prime is 145206523331. The next prime is 145206523373. The reversal of 145206523341 is 143325602541.
145206523341 is a `hidden beast` number, since 1 + 4 + 520 + 65 + 2 + 33 + 41 = 666.
It is not a de Polignac number, because 145206523341 - 214 = 145206506957 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 145206523296 and 145206523305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145206523331) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 244455130 + ... + 244455723.
It is an arithmetic number, because the mean of its divisors is an integer number (14667325620).
Almost surely, 2145206523341 is an apocalyptic number.
145206523341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
145206523341 is a deficient number, since it is larger than the sum of its proper divisors (89470686579).
145206523341 is a wasteful number, since it uses less digits than its factorization.
145206523341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 488910873 (or 488910867 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
The spelling of 145206523341 in words is "one hundred forty-five billion, two hundred six million, five hundred twenty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.550 sec. • engine limits •