Base | Representation |
---|---|
bin | 101111110110100101… |
… | …0100000001111010001 |
3 | 100211020202002112002121 |
4 | 1133231022200033101 |
5 | 3140424334421424 |
6 | 115113032014241 |
7 | 10265365541344 |
oct | 1375512401721 |
9 | 324222075077 |
10 | 102763201489 |
11 | 3a64416a2a3 |
12 | 17abb231381 |
13 | 98c9124400 |
14 | 4d8c02645b |
15 | 2a16b05ee4 |
hex | 17ed2a03d1 |
102763201489 has 9 divisors (see below), whose sum is σ = 111280642203. Its totient is φ = 94854493032.
The previous prime is 102763201481. The next prime is 102763201493. The reversal of 102763201489 is 984102367201.
The square root of 102763201489 is 320567.
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., 15201657025 + 87561544464 = 123295^2 + 295908^2 .
It is not a de Polignac number, because 102763201489 - 23 = 102763201481 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102763201481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 4155042 + ... + 4179700.
Almost surely, 2102763201489 is an apocalyptic number.
102763201489 is the 320567-th square number.
102763201489 is the 160284-th centered octagonal number.
It is an amenable number.
102763201489 is a deficient number, since it is larger than the sum of its proper divisors (8517440714).
102763201489 is an frugal number, since it uses more digits than its factorization.
102763201489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49344 (or 24672 counting only the distinct ones).
The product of its (nonzero) digits is 145152, while the sum is 43.
The spelling of 102763201489 in words is "one hundred two billion, seven hundred sixty-three million, two hundred one thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •