Base | Representation |
---|---|
bin | 1000011100001110001… |
… | …1011100100001011110 |
3 | 111212022022212120121110 |
4 | 2013003203130201132 |
5 | 4333442240113013 |
6 | 150341401442450 |
7 | 13322413130205 |
oct | 2070343344136 |
9 | 455268776543 |
10 | 145014769758 |
11 | 56556069961 |
12 | 241311a0426 |
13 | 108a07c2491 |
14 | 703965623c |
15 | 3b8b0e42c3 |
hex | 21c38dc85e |
145014769758 has 128 divisors (see below), whose sum is σ = 328252953600. Its totient is φ = 42484119552.
The previous prime is 145014769733. The next prime is 145014769759. The reversal of 145014769758 is 857967410541.
It is a junction number, because it is equal to n+sod(n) for n = 145014769698 and 145014769707.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145014769759) 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, 13095448 + ... + 13106516.
It is an arithmetic number, because the mean of its divisors is an integer number (2564476200).
Almost surely, 2145014769758 is an apocalyptic number.
145014769758 is an abundant number, since it is smaller than the sum of its proper divisors (183238183842).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145014769758 is a wasteful number, since it uses less digits than its factorization.
145014769758 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11266.
The product of its (nonzero) digits is 8467200, while the sum is 57.
The spelling of 145014769758 in words is "one hundred forty-five billion, fourteen million, seven hundred sixty-nine thousand, seven hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •