Base | Representation |
---|---|
bin | 1011100110100001110… |
… | …10011011000000111001 |
3 | 1102002222001012011011021 |
4 | 11303100322123000321 |
5 | 23012404320422121 |
6 | 503044504502441 |
7 | 40541501545414 |
oct | 5632072330071 |
9 | 1362861164137 |
10 | 398641967161 |
11 | 144076aa8209 |
12 | 6531447aa21 |
13 | 2b790194909 |
14 | 15419a96b7b |
15 | a582593641 |
hex | 5cd0e9b039 |
398641967161 has 9 divisors (see below), whose sum is σ = 403555799461. Its totient is φ = 393787278652.
The previous prime is 398641967159. The next prime is 398641967179. The reversal of 398641967161 is 161769146893.
The square root of 398641967161 is 631381.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 398641967161 - 21 = 398641967159 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 398641967161.
It is not an unprimeable number, because it can be changed into a prime (398641967111) 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, 52400820 + ... + 52408426.
Almost surely, 2398641967161 is an apocalyptic number.
398641967161 is the 631381-st square number.
398641967161 is the 315691-st centered octagonal number.
It is an amenable number.
398641967161 is a deficient number, since it is larger than the sum of its proper divisors (4913832300).
398641967161 is an frugal number, since it uses more digits than its factorization.
398641967161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15380 (or 7690 counting only the distinct ones).
The product of its digits is 11757312, while the sum is 61.
The spelling of 398641967161 in words is "three hundred ninety-eight billion, six hundred forty-one million, nine hundred sixty-seven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •