Base | Representation |
---|---|
bin | 100001000111000100100010… |
… | …001000111101111001110101 |
3 | 201002121021101110101001212012 |
4 | 201013010202020331321311 |
5 | 123041330201332300213 |
6 | 1233413322052534005 |
7 | 42446542002656555 |
oct | 4107044210757165 |
9 | 632537343331765 |
10 | 145621438946933 |
11 | 42443783a40464 |
12 | 143ba4b1321305 |
13 | 6334072c73981 |
14 | 27d618836d165 |
15 | 11c7e33cd14a8 |
hex | 84712223de75 |
145621438946933 has 2 divisors, whose sum is σ = 145621438946934. Its totient is φ = 145621438946932.
The previous prime is 145621438946903. The next prime is 145621438946957. The reversal of 145621438946933 is 339649834126541.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 124159696433809 + 21461742513124 = 11142697^2 + 4632682^2 .
It is an emirp because it is prime and its reverse (339649834126541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 145621438946933 - 26 = 145621438946869 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145621438946903) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72810719473466 + 72810719473467.
It is an arithmetic number, because the mean of its divisors is an integer number (72810719473467).
Almost surely, 2145621438946933 is an apocalyptic number.
It is an amenable number.
145621438946933 is a deficient number, since it is larger than the sum of its proper divisors (1).
145621438946933 is an equidigital number, since it uses as much as digits as its factorization.
145621438946933 is an evil number, because the sum of its binary digits is even.
The product of its digits is 403107840, while the sum is 68.
The spelling of 145621438946933 in words is "one hundred forty-five trillion, six hundred twenty-one billion, four hundred thirty-eight million, nine hundred forty-six thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •