Base | Representation |
---|---|
bin | 1000011101011111101… |
… | …1110000110010111011 |
3 | 111220012011020212001012 |
4 | 2013113323300302323 |
5 | 4340142303013241 |
6 | 150435334144135 |
7 | 13334034316103 |
oct | 2072773606273 |
9 | 456164225035 |
10 | 145356688571 |
11 | 56711074596 |
12 | 242077b204b |
13 | 109265a92c3 |
14 | 706cc1c203 |
15 | 3bab1336eb |
hex | 21d7ef0cbb |
145356688571 has 4 divisors (see below), whose sum is σ = 145360352544. Its totient is φ = 145353024600.
The previous prime is 145356688549. The next prime is 145356688583. The reversal of 145356688571 is 175886653541.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 145356688571 - 214 = 145356672187 is a prime.
It is a super-2 number, since 2×1453566885712 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 145356688571.
It is not an unprimeable number, because it can be changed into a prime (145356688511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1771820 + ... + 1852041.
It is an arithmetic number, because the mean of its divisors is an integer number (36340088136).
Almost surely, 2145356688571 is an apocalyptic number.
145356688571 is a deficient number, since it is larger than the sum of its proper divisors (3663973).
145356688571 is an equidigital number, since it uses as much as digits as its factorization.
145356688571 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3663972.
The product of its digits is 24192000, while the sum is 59.
The spelling of 145356688571 in words is "one hundred forty-five billion, three hundred fifty-six million, six hundred eighty-eight thousand, five hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •