Base | Representation |
---|---|
bin | 1000011101101101101… |
… | …1010110111101101101 |
3 | 111220100020112202221202 |
4 | 2013123123112331231 |
5 | 4340302304144041 |
6 | 150445230335245 |
7 | 13335345452522 |
oct | 2073333267555 |
9 | 456306482852 |
10 | 145415303021 |
11 | 5674116948a |
12 | 2422335a525 |
13 | 1093578c701 |
14 | 7076919149 |
15 | 3bb1360a9b |
hex | 21db6d6f6d |
145415303021 has 2 divisors, whose sum is σ = 145415303022. Its totient is φ = 145415303020.
The previous prime is 145415303003. The next prime is 145415303023. The reversal of 145415303021 is 120303514541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 133287787396 + 12127515625 = 365086^2 + 110125^2 .
It is a cyclic number.
It is not a de Polignac number, because 145415303021 - 26 = 145415302957 is a prime.
It is a super-2 number, since 2×1454153030212 (a number of 23 digits) contains 22 as substring.
Together with 145415303023, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145415303023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72707651510 + 72707651511.
It is an arithmetic number, because the mean of its divisors is an integer number (72707651511).
Almost surely, 2145415303021 is an apocalyptic number.
It is an amenable number.
145415303021 is a deficient number, since it is larger than the sum of its proper divisors (1).
145415303021 is an equidigital number, since it uses as much as digits as its factorization.
145415303021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7200, while the sum is 29.
Adding to 145415303021 its reverse (120303514541), we get a palindrome (265718817562).
The spelling of 145415303021 in words is "one hundred forty-five billion, four hundred fifteen million, three hundred three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •