Base | Representation |
---|---|
bin | 1000011110000110110… |
… | …0010111000100100001 |
3 | 111220121120100102201202 |
4 | 2013201230113010201 |
5 | 4341011212020301 |
6 | 150503503410545 |
7 | 13341063121406 |
oct | 2074154270441 |
9 | 456546312652 |
10 | 145520423201 |
11 | 5679553786a |
12 | 242525b3a55 |
13 | 109514a68ba |
14 | 70868802ad |
15 | 3bba6c766b |
hex | 21e1b17121 |
145520423201 has 2 divisors, whose sum is σ = 145520423202. Its totient is φ = 145520423200.
The previous prime is 145520423189. The next prime is 145520423203. The reversal of 145520423201 is 102324025541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 136829709025 + 8690714176 = 369905^2 + 93224^2 .
It is an emirp because it is prime and its reverse (102324025541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 145520423201 - 218 = 145520161057 is a prime.
It is a Sophie Germain prime.
Together with 145520423203, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (145520423203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72760211600 + 72760211601.
It is an arithmetic number, because the mean of its divisors is an integer number (72760211601).
Almost surely, 2145520423201 is an apocalyptic number.
It is an amenable number.
145520423201 is a deficient number, since it is larger than the sum of its proper divisors (1).
145520423201 is an equidigital number, since it uses as much as digits as its factorization.
145520423201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9600, while the sum is 29.
Adding to 145520423201 its reverse (102324025541), we get a palindrome (247844448742).
The spelling of 145520423201 in words is "one hundred forty-five billion, five hundred twenty million, four hundred twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •