Base | Representation |
---|---|
bin | 10011111000101000… |
… | …10101111111010001 |
3 | 1000120000002211011001 |
4 | 21330110111333101 |
5 | 133330431023241 |
6 | 4523200022001 |
7 | 525360314431 |
oct | 117424257721 |
9 | 30500084131 |
10 | 10675642321 |
11 | 45891380a3 |
12 | 209b301901 |
13 | 101197bb26 |
14 | 733b9a2c1 |
15 | 42736d431 |
hex | 27c515fd1 |
10675642321 has 2 divisors, whose sum is σ = 10675642322. Its totient is φ = 10675642320.
The previous prime is 10675642319. The next prime is 10675642331. The reversal of 10675642321 is 12324657601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9421420096 + 1254222225 = 97064^2 + 35415^2 .
It is an emirp because it is prime and its reverse (12324657601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10675642321 - 21 = 10675642319 is a prime.
It is a super-2 number, since 2×106756423212 (a number of 21 digits) contains 22 as substring.
Together with 10675642319, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10675642331) 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 as a sum of consecutive naturals, namely, 5337821160 + 5337821161.
It is an arithmetic number, because the mean of its divisors is an integer number (5337821161).
Almost surely, 210675642321 is an apocalyptic number.
It is an amenable number.
10675642321 is a deficient number, since it is larger than the sum of its proper divisors (1).
10675642321 is an equidigital number, since it uses as much as digits as its factorization.
10675642321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60480, while the sum is 37.
The spelling of 10675642321 in words is "ten billion, six hundred seventy-five million, six hundred forty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •