Base | Representation |
---|---|
bin | 101000001110110101… |
… | …1001001100001000100 |
3 | 22021000011120022122100 |
4 | 1100131223021201010 |
5 | 2403420140240411 |
6 | 103405035432100 |
7 | 6146001023562 |
oct | 1203553114104 |
9 | 267004508570 |
10 | 86397196356 |
11 | 33705a68419 |
12 | 148b22b5630 |
13 | 81bb59ccc3 |
14 | 427861ca32 |
15 | 23a9e14456 |
hex | 141dac9844 |
86397196356 has 27 divisors (see below), whose sum is σ = 218397371101. Its totient is φ = 28798477584.
The previous prime is 86397196351. The next prime is 86397196409. The reversal of 86397196356 is 65369179368.
The square root of 86397196356 is 293934.
It is a perfect power (a square), and thus also a powerful number.
86397196356 is a `hidden beast` number, since 8 + 6 + 3 + 97 + 196 + 356 = 666.
It can be written as a sum of positive squares in only one way, i.e., 31741956 + 86365454400 = 5634^2 + 293880^2 .
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 86397196293 and 86397196302.
It is not an unprimeable number, because it can be changed into a prime (86397196351) 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, 1739110 + ... + 1788098.
Almost surely, 286397196356 is an apocalyptic number.
86397196356 is the 293934-th square number.
It is an amenable number.
86397196356 is an abundant number, since it is smaller than the sum of its proper divisors (132000174745).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
86397196356 is an frugal number, since it uses more digits than its factorization.
86397196356 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97988 (or 48994 counting only the distinct ones).
The product of its digits is 44089920, while the sum is 63.
The spelling of 86397196356 in words is "eighty-six billion, three hundred ninety-seven million, one hundred ninety-six thousand, three hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •