Base | Representation |
---|---|
bin | 100001000111001011001110… |
… | …110110110011010100100111 |
3 | 201002121221221201122020121011 |
4 | 201013023032312303110213 |
5 | 123041434414143020123 |
6 | 1233420511512403051 |
7 | 42450215151416635 |
oct | 4107131666632447 |
9 | 632557851566534 |
10 | 145628631610663 |
11 | 42446835017153 |
12 | 143bb97a0a6487 |
13 | 633494b165906 |
14 | 27d666b71c355 |
15 | 11c82054a5e0d |
hex | 8472cedb3527 |
145628631610663 has 4 divisors (see below), whose sum is σ = 147129957709840. Its totient is φ = 144127305511488.
The previous prime is 145628631610643. The next prime is 145628631610667. The reversal of 145628631610663 is 366016136826541.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145628631610663 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 145628631610598 and 145628631610607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145628631610667) 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, 750663049443 + ... + 750663049636.
It is an arithmetic number, because the mean of its divisors is an integer number (36782489427460).
Almost surely, 2145628631610663 is an apocalyptic number.
145628631610663 is a deficient number, since it is larger than the sum of its proper divisors (1501326099177).
145628631610663 is an equidigital number, since it uses as much as digits as its factorization.
145628631610663 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1501326099176.
The product of its (nonzero) digits is 22394880, while the sum is 58.
The spelling of 145628631610663 in words is "one hundred forty-five trillion, six hundred twenty-eight billion, six hundred thirty-one million, six hundred ten thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •