Base | Representation |
---|---|
bin | 111111111001101110001… |
… | …010100001111111001001 |
3 | 120112210201120202201022202 |
4 | 333321232022201333021 |
5 | 1033421343014042141 |
6 | 13201200530325545 |
7 | 632155425123011 |
oct | 77715612417711 |
9 | 16483646681282 |
10 | 4391304830921 |
11 | 1443384106818 |
12 | 5ab0931298b5 |
13 | 25b137b863c8 |
14 | 11277c79ac41 |
15 | 7936433c49b |
hex | 3fe6e2a1fc9 |
4391304830921 has 2 divisors, whose sum is σ = 4391304830922. Its totient is φ = 4391304830920.
The previous prime is 4391304830851. The next prime is 4391304830959. The reversal of 4391304830921 is 1290384031934.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2443985055625 + 1947319775296 = 1563325^2 + 1395464^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4391304830921 is a prime.
It is a super-2 number, since 2×43913048309212 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4391304830981) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2195652415460 + 2195652415461.
It is an arithmetic number, because the mean of its divisors is an integer number (2195652415461).
Almost surely, 24391304830921 is an apocalyptic number.
It is an amenable number.
4391304830921 is a deficient number, since it is larger than the sum of its proper divisors (1).
4391304830921 is an equidigital number, since it uses as much as digits as its factorization.
4391304830921 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 559872, while the sum is 47.
It can be divided in two parts, 4391304 and 830921, that added together give a palindrome (5222225).
The spelling of 4391304830921 in words is "four trillion, three hundred ninety-one billion, three hundred four million, eight hundred thirty thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •