Base | Representation |
---|---|
bin | 1011011110100100001… |
… | …00011111010101000100 |
3 | 1101200221001222122211211 |
4 | 11233102010133111010 |
5 | 22430130300304241 |
6 | 501100332541204 |
7 | 40330524141304 |
oct | 5572204372504 |
9 | 1350831878754 |
10 | 394366416196 |
11 | 142282619515 |
12 | 64520621804 |
13 | 2b25b4558bc |
14 | 15131cd5604 |
15 | a3d203d781 |
hex | 5bd211f544 |
394366416196 has 9 divisors (see below), whose sum is σ = 690143426301. Its totient is φ = 197182580112.
The previous prime is 394366416161. The next prime is 394366416247. The reversal of 394366416196 is 691614663493.
The square root of 394366416196 is 627986.
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., 328592632900 + 65773783296 = 573230^2 + 256464^2 .
It is a super-2 number, since 2×3943664161962 (a number of 24 digits) contains 22 as substring.
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 394366416196.
It is an unprimeable number.
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 2 ways as a sum of consecutive naturals, for example, 1098976 + ... + 1412968.
Almost surely, 2394366416196 is an apocalyptic number.
394366416196 is the 627986-th square number.
It is an amenable number.
394366416196 is a deficient number, since it is larger than the sum of its proper divisors (295777010105).
394366416196 is an frugal number, since it uses more digits than its factorization.
394366416196 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 627990 (or 313995 counting only the distinct ones).
The product of its digits is 15116544, while the sum is 58.
The spelling of 394366416196 in words is "three hundred ninety-four billion, three hundred sixty-six million, four hundred sixteen thousand, one hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •