Base | Representation |
---|---|
bin | 110111101111010000… |
… | …1000001101101111001 |
3 | 102102221220121201002221 |
4 | 1233132201001231321 |
5 | 3430120003113404 |
6 | 130553240524041 |
7 | 11435132255614 |
oct | 1573641015571 |
9 | 372856551087 |
10 | 119697316729 |
11 | 46844018761 |
12 | 1b246480621 |
13 | b39758a143 |
14 | 5b1707517b |
15 | 31a8616954 |
hex | 1bde841b79 |
119697316729 has 9 divisors (see below), whose sum is σ = 120227255757. Its totient is φ = 119169707904.
The previous prime is 119697316723. The next prime is 119697316751. The reversal of 119697316729 is 927613796911.
The square root of 119697316729 is 345973.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 22510501225 + 97186815504 = 150035^2 + 311748^2 .
It is not a de Polignac number, because 119697316729 - 221 = 119695219577 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (119697316723) 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, 95833897 + ... + 95835145.
It is an arithmetic number, because the mean of its divisors is an integer number (13358583973).
Almost surely, 2119697316729 is an apocalyptic number.
119697316729 is the 345973-rd square number.
119697316729 is the 172987-th centered octagonal number.
It is an amenable number.
119697316729 is a deficient number, since it is larger than the sum of its proper divisors (529939028).
119697316729 is an frugal number, since it uses more digits than its factorization.
119697316729 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3052 (or 1526 counting only the distinct ones).
The product of its digits is 7715736, while the sum is 61.
The spelling of 119697316729 in words is "one hundred nineteen billion, six hundred ninety-seven million, three hundred sixteen thousand, seven hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •