Base | Representation |
---|---|
bin | 1000110111001110111011… |
… | …11111101010000011011001 |
3 | 2120000020001222200200010121 |
4 | 10123213131333222003121 |
5 | 10023311000203332014 |
6 | 105241324524513241 |
7 | 4051051101463051 |
oct | 433473577520331 |
9 | 76006058620117 |
10 | 19489991074009 |
11 | 6234727949385 |
12 | 222935a6ab821 |
13 | ab4b8a671a61 |
14 | 4b546ba30561 |
15 | 23bea56d0124 |
hex | 11b9ddfea0d9 |
19489991074009 has 9 divisors (see below), whose sum is σ = 20703980278111. Its totient is φ = 18343450374880.
The previous prime is 19489991073901. The next prime is 19489991074013. The reversal of 19489991074009 is 90047019998491.
The square root of 19489991074009 is 4414747.
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., 15173868483225 + 4316122590784 = 3895365^2 + 2077528^2 .
It is not a de Polignac number, because 19489991074009 - 235 = 19455631335641 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (19489991074019) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 74920854 + ... + 75180544.
Almost surely, 219489991074009 is an apocalyptic number.
19489991074009 is the 4414747-th square number.
19489991074009 is the 2207374-th centered octagonal number.
It is an amenable number.
19489991074009 is a deficient number, since it is larger than the sum of its proper divisors (1213989204102).
19489991074009 is an frugal number, since it uses more digits than its factorization.
19489991074009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 519416 (or 259708 counting only the distinct ones).
The product of its (nonzero) digits is 52907904, while the sum is 70.
The spelling of 19489991074009 in words is "nineteen trillion, four hundred eighty-nine billion, nine hundred ninety-one million, seventy-four thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •