Base | Representation |
---|---|
bin | 100001000001100111001010… |
… | …010111010011010000011111 |
3 | 201001021102002200002010102201 |
4 | 201001213022113103100133 |
5 | 123014203412330422110 |
6 | 1232525121520232331 |
7 | 42410461550566534 |
oct | 4101471227232037 |
9 | 631242080063381 |
10 | 145246304154655 |
11 | 4230968014a710 |
12 | 1435985946b6a7 |
13 | 630788ac65cc2 |
14 | 27c1d5c6a6d8b |
15 | 11bd2ca331b3a |
hex | 8419ca5d341f |
145246304154655 has 64 divisors (see below), whose sum is σ = 193825443056256. Its totient is φ = 103596869376000.
The previous prime is 145246304154571. The next prime is 145246304154739. The reversal of 145246304154655 is 556451403642541.
It is an interprime number because it is at equal distance from previous prime (145246304154571) and next prime (145246304154739).
It is a de Polignac number, because none of the positive numbers 2k-145246304154655 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (55).
It is a junction number, because it is equal to n+sod(n) for n = 145246304154596 and 145246304154605.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5782776157 + ... + 5782801273.
It is an arithmetic number, because the mean of its divisors is an integer number (3028522547754).
Almost surely, 2145246304154655 is an apocalyptic number.
145246304154655 is a deficient number, since it is larger than the sum of its proper divisors (48579138901601).
145246304154655 is a wasteful number, since it uses less digits than its factorization.
145246304154655 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30188.
The product of its (nonzero) digits is 34560000, while the sum is 55.
The spelling of 145246304154655 in words is "one hundred forty-five trillion, two hundred forty-six billion, three hundred four million, one hundred fifty-four thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •