Base | Representation |
---|---|
bin | 1011100010011100010… |
… | …10010011001001101011 |
3 | 1101220022011110000200112 |
4 | 11301032022103021223 |
5 | 22443411232021323 |
6 | 502043103124535 |
7 | 40433234032142 |
oct | 5611612231153 |
9 | 1356264400615 |
10 | 396448313963 |
11 | 143150813089 |
12 | 64a018a374b |
13 | 2b500876080 |
14 | 1528c5cc759 |
15 | a4a4bcc178 |
hex | 5c4e29326b |
396448313963 has 4 divisors (see below), whose sum is σ = 426944338128. Its totient is φ = 365952289800.
The previous prime is 396448313887. The next prime is 396448314007. The reversal of 396448313963 is 369313844693.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 369313844693 = 23831 ⋅15497203.
It is a cyclic number.
It is not a de Polignac number, because 396448313963 - 28 = 396448313707 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (396448312963) 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 3 ways as a sum of consecutive naturals, for example, 15248012063 + ... + 15248012088.
It is an arithmetic number, because the mean of its divisors is an integer number (106736084532).
Almost surely, 2396448313963 is an apocalyptic number.
396448313963 is a deficient number, since it is larger than the sum of its proper divisors (30496024165).
396448313963 is a wasteful number, since it uses less digits than its factorization.
396448313963 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30496024164.
The product of its digits is 30233088, while the sum is 59.
The spelling of 396448313963 in words is "three hundred ninety-six billion, four hundred forty-eight million, three hundred thirteen thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •