Base | Representation |
---|---|
bin | 1011100011010011101… |
… | …11011100101010101011 |
3 | 1101221111120002100020202 |
4 | 11301221313130222223 |
5 | 23000334230244001 |
6 | 502201145542415 |
7 | 40450606655264 |
oct | 5615167345253 |
9 | 1357446070222 |
10 | 396913134251 |
11 | 14336a131487 |
12 | 64b114a4a0b |
13 | 2b575c6166a |
14 | 152d422796b |
15 | a4d08e696b |
hex | 5c69ddcaab |
396913134251 has 4 divisors (see below), whose sum is σ = 397530418152. Its totient is φ = 396295850352.
The previous prime is 396913134199. The next prime is 396913134257. The reversal of 396913134251 is 152431319693.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-396913134251 is a prime.
It is a super-2 number, since 2×3969131342512 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 396913134196 and 396913134205.
It is not an unprimeable number, because it can be changed into a prime (396913134257) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 308640986 + ... + 308642271.
It is an arithmetic number, because the mean of its divisors is an integer number (99382604538).
Almost surely, 2396913134251 is an apocalyptic number.
396913134251 is a deficient number, since it is larger than the sum of its proper divisors (617283901).
396913134251 is an equidigital number, since it uses as much as digits as its factorization.
396913134251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 617283900.
The product of its digits is 524880, while the sum is 47.
The spelling of 396913134251 in words is "three hundred ninety-six billion, nine hundred thirteen million, one hundred thirty-four thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •