Base | Representation |
---|---|
bin | 111011101000010… |
… | …001110001110001 |
3 | 2120201110022110021 |
4 | 323220101301301 |
5 | 4022101224241 |
6 | 243134203441 |
7 | 33535244554 |
oct | 7350216161 |
9 | 2521408407 |
10 | 1000414321 |
11 | 4737870a5 |
12 | 23b053581 |
13 | 12c35394a |
14 | 96c1869b |
15 | 5cc640d1 |
hex | 3ba11c71 |
1000414321 has 2 divisors, whose sum is σ = 1000414322. Its totient is φ = 1000414320.
The previous prime is 1000414313. The next prime is 1000414343. The reversal of 1000414321 is 1234140001.
1000414321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 758176225 + 242238096 = 27535^2 + 15564^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000414321 - 23 = 1000414313 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1000414295 and 1000414304.
It is not a weakly prime, because it can be changed into another prime (1000415321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500207160 + 500207161.
It is an arithmetic number, because the mean of its divisors is an integer number (500207161).
Almost surely, 21000414321 is an apocalyptic number.
It is an amenable number.
1000414321 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000414321 is an equidigital number, since it uses as much as digits as its factorization.
1000414321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 1000414321 is about 31629.3269134833. The cubic root of 1000414321 is about 1000.1380879308.
Adding to 1000414321 its reverse (1234140001), we get a palindrome (2234554322).
The spelling of 1000414321 in words is "one billion, four hundred fourteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •