Base | Representation |
---|---|
bin | 101011111010000001110010… |
… | …1110000111001011100000100 |
3 | 1212122110001120202022102211101 |
4 | 1113310003211300321130010 |
5 | 401110110034344310324 |
6 | 3445221105111345444 |
7 | 144230362162542061 |
oct | 12764034560713404 |
9 | 1778401522272741 |
10 | 386207314056964 |
11 | 10206a669421494 |
12 | 37395694082284 |
13 | 13766268ccc03a |
14 | 6b52768809c68 |
15 | 2e9b212857944 |
hex | 15f40e5c39704 |
386207314056964 has 9 divisors (see below), whose sum is σ = 675862868382247. Its totient is φ = 193103637376324.
The previous prime is 386207314056947. The next prime is 386207314056989. The reversal of 386207314056964 is 469650413702683.
The square root of 386207314056964 is 19652158.
It is a perfect power (a square), and thus also a powerful number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 386207314056896 and 386207314056905.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 34391277 + ... + 44217355.
It is a 1-persistent number, because it is pandigital, but 2⋅386207314056964 = 772414628113928 is not.
Almost surely, 2386207314056964 is an apocalyptic number.
386207314056964 is the 19652158-th square number.
It is an amenable number.
386207314056964 is a deficient number, since it is larger than the sum of its proper divisors (289655554325283).
386207314056964 is an frugal number, since it uses more digits than its factorization.
386207314056964 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19652162 (or 9826081 counting only the distinct ones).
The product of its (nonzero) digits is 156764160, while the sum is 64.
The spelling of 386207314056964 in words is "three hundred eighty-six trillion, two hundred seven billion, three hundred fourteen million, fifty-six thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •