Base | Representation |
---|---|
bin | 1000011100111011010… |
… | …1100001000100100011 |
3 | 111212210112001100000011 |
4 | 2013032311201010203 |
5 | 4334334214300410 |
6 | 150412242505351 |
7 | 13330202054161 |
oct | 2071665410443 |
9 | 455715040004 |
10 | 145204056355 |
11 | 566429a4766 |
12 | 24184665257 |
13 | 10900a98297 |
14 | 705684a231 |
15 | 3b9ca3418a |
hex | 21ced61123 |
145204056355 has 4 divisors (see below), whose sum is σ = 174244867632. Its totient is φ = 116163245080.
The previous prime is 145204056271. The next prime is 145204056373. The reversal of 145204056355 is 553650402541.
It is a semiprime because it is the product of two primes.
It is a de Polignac number, because none of the positive numbers 2k-145204056355 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 14520405631 + ... + 14520405640.
It is an arithmetic number, because the mean of its divisors is an integer number (43561216908).
Almost surely, 2145204056355 is an apocalyptic number.
145204056355 is a deficient number, since it is larger than the sum of its proper divisors (29040811277).
145204056355 is an equidigital number, since it uses as much as digits as its factorization.
145204056355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29040811276.
The product of its (nonzero) digits is 360000, while the sum is 40.
Adding to 145204056355 its reverse (553650402541), we get a palindrome (698854458896).
The spelling of 145204056355 in words is "one hundred forty-five billion, two hundred four million, fifty-six thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •