Base | Representation |
---|---|
bin | 1000010001101100110… |
… | …0000111001000110001 |
3 | 111121000110201111111001 |
4 | 2010123030013020301 |
5 | 4312201130034221 |
6 | 145153214522001 |
7 | 13162413512554 |
oct | 2043314071061 |
9 | 447013644431 |
10 | 142190080561 |
11 | 55336659081 |
12 | 23683206301 |
13 | 1054052c659 |
14 | 6c4c44669b |
15 | 3a7312e391 |
hex | 211b307231 |
142190080561 has 27 divisors (see below), whose sum is σ = 148670348203. Its totient is φ = 135990491840.
The previous prime is 142190080553. The next prime is 142190080567. The reversal of 142190080561 is 165080091241.
The square root of 142190080561 is 377081.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 2505503025 + 139684577536 = 50055^2 + 373744^2 .
It is not a de Polignac number, because 142190080561 - 23 = 142190080553 is a prime.
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 142190080561.
It is not an unprimeable number, because it can be changed into a prime (142190080567) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 1258319241 + ... + 1258319353.
Almost surely, 2142190080561 is an apocalyptic number.
142190080561 is the 377081-st square number.
142190080561 is the 188541-st centered octagonal number.
It is an amenable number.
142190080561 is a deficient number, since it is larger than the sum of its proper divisors (6480267642).
142190080561 is an frugal number, since it uses more digits than its factorization.
142190080561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 462 (or 231 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 37.
The spelling of 142190080561 in words is "one hundred forty-two billion, one hundred ninety million, eighty thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •