Base | Representation |
---|---|
bin | 1000011111010010010… |
… | …0100101100111101111 |
3 | 111221102122022221222211 |
4 | 2013310210211213233 |
5 | 4342133302342001 |
6 | 150555140151251 |
7 | 13351660226233 |
oct | 2076444454757 |
9 | 457378287884 |
10 | 145837152751 |
11 | 569382a8424 |
12 | 24320698527 |
13 | 109a1cb1334 |
14 | 70b696a5c3 |
15 | 3bd83dd351 |
hex | 21f49259ef |
145837152751 has 2 divisors, whose sum is σ = 145837152752. Its totient is φ = 145837152750.
The previous prime is 145837152719. The next prime is 145837152767. The reversal of 145837152751 is 157251738541.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 145837152751 - 25 = 145837152719 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 145837152695 and 145837152704.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145837152781) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72918576375 + 72918576376.
It is an arithmetic number, because the mean of its divisors is an integer number (72918576376).
Almost surely, 2145837152751 is an apocalyptic number.
145837152751 is a deficient number, since it is larger than the sum of its proper divisors (1).
145837152751 is an equidigital number, since it uses as much as digits as its factorization.
145837152751 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1176000, while the sum is 49.
The spelling of 145837152751 in words is "one hundred forty-five billion, eight hundred thirty-seven million, one hundred fifty-two thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •