Base | Representation |
---|---|
bin | 1000011100011110111… |
… | …1110011000110001111 |
3 | 111212111020020120122000 |
4 | 2013013233303012033 |
5 | 4334113242214230 |
6 | 150352353323343 |
7 | 13324226100522 |
oct | 2070757630617 |
9 | 455436216560 |
10 | 145085116815 |
11 | 56591847721 |
12 | 24150866553 |
13 | 108b2252c62 |
14 | 7044b28bb9 |
15 | 3b9238cb60 |
hex | 21c7bf318f |
145085116815 has 64 divisors (see below), whose sum is σ = 259355873280. Its totient is φ = 76951451520.
The previous prime is 145085116777. The next prime is 145085116817. The reversal of 145085116815 is 518611580541.
145085116815 is a `hidden beast` number, since 1 + 4 + 50 + 8 + 511 + 6 + 81 + 5 = 666.
It is not a de Polignac number, because 145085116815 - 26 = 145085116751 is a prime.
It is a super-2 number, since 2×1450851168152 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145085116817) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 38863689 + ... + 38867421.
It is an arithmetic number, because the mean of its divisors is an integer number (4052435520).
Almost surely, 2145085116815 is an apocalyptic number.
145085116815 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
145085116815 is a deficient number, since it is larger than the sum of its proper divisors (114270756465).
145085116815 is a wasteful number, since it uses less digits than its factorization.
145085116815 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5261 (or 5255 counting only the distinct ones).
The product of its (nonzero) digits is 192000, while the sum is 45.
The spelling of 145085116815 in words is "one hundred forty-five billion, eighty-five million, one hundred sixteen thousand, eight hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •