Base | Representation |
---|---|
bin | 1000011101111001001… |
… | …1111110110100001111 |
3 | 111220110121121122011021 |
4 | 2013132103332310033 |
5 | 4340402201411001 |
6 | 150454115535011 |
7 | 13336504025005 |
oct | 2073623766417 |
9 | 456417548137 |
10 | 145463700751 |
11 | 56766515406 |
12 | 242375ba467 |
13 | 10942806715 |
14 | 707d116a75 |
15 | 3bb5720ba1 |
hex | 21de4fed0f |
145463700751 has 2 divisors, whose sum is σ = 145463700752. Its totient is φ = 145463700750.
The previous prime is 145463700703. The next prime is 145463700763. The reversal of 145463700751 is 157007364541.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 145463700751 - 213 = 145463692559 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 145463700698 and 145463700707.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145463700251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72731850375 + 72731850376.
It is an arithmetic number, because the mean of its divisors is an integer number (72731850376).
Almost surely, 2145463700751 is an apocalyptic number.
145463700751 is a deficient number, since it is larger than the sum of its proper divisors (1).
145463700751 is an equidigital number, since it uses as much as digits as its factorization.
145463700751 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 352800, while the sum is 43.
The spelling of 145463700751 in words is "one hundred forty-five billion, four hundred sixty-three million, seven hundred thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •