Base | Representation |
---|---|
bin | 1000011101101010011… |
… | …0000010101000110011 |
3 | 111220022021020200021011 |
4 | 2013122212002220303 |
5 | 4340240214414011 |
6 | 150444011011351 |
7 | 13335115610545 |
oct | 2073246025063 |
9 | 456267220234 |
10 | 145401326131 |
11 | 56734292436 |
12 | 2421a739b57 |
13 | 10932907969 |
14 | 7074b1b695 |
15 | 3baeeee621 |
hex | 21da982a33 |
145401326131 has 2 divisors, whose sum is σ = 145401326132. Its totient is φ = 145401326130.
The previous prime is 145401325999. The next prime is 145401326143. The reversal of 145401326131 is 131623104541.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 145401326131 - 213 = 145401317939 is a prime.
It is a super-2 number, since 2×1454013261312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145401326093 and 145401326102.
It is not a weakly prime, because it can be changed into another prime (145401326531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72700663065 + 72700663066.
It is an arithmetic number, because the mean of its divisors is an integer number (72700663066).
Almost surely, 2145401326131 is an apocalyptic number.
145401326131 is a deficient number, since it is larger than the sum of its proper divisors (1).
145401326131 is an equidigital number, since it uses as much as digits as its factorization.
145401326131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 31.
The spelling of 145401326131 in words is "one hundred forty-five billion, four hundred one million, three hundred twenty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •