Base | Representation |
---|---|
bin | 11101101110010100011… |
… | …01110100010100100001 |
3 | 10121122011010212212201122 |
4 | 32313022031310110201 |
5 | 113213110231301321 |
6 | 2101102332342025 |
7 | 133533522436241 |
oct | 16671215642441 |
9 | 3548133785648 |
10 | 1021299868961 |
11 | 364149172789 |
12 | 145b27314915 |
13 | 754010638b8 |
14 | 37607217b21 |
15 | 1b8766988ab |
hex | edca374521 |
1021299868961 has 2 divisors, whose sum is σ = 1021299868962. Its totient is φ = 1021299868960.
The previous prime is 1021299868937. The next prime is 1021299868993. The reversal of 1021299868961 is 1698689921201.
1021299868961 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., 801169996561 + 220129872400 = 895081^2 + 469180^2 .
It is a cyclic number.
It is not a de Polignac number, because 1021299868961 - 234 = 1004119999777 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1021299868894 and 1021299868903.
It is not a weakly prime, because it can be changed into another prime (1021299828961) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510649934480 + 510649934481.
It is an arithmetic number, because the mean of its divisors is an integer number (510649934481).
Almost surely, 21021299868961 is an apocalyptic number.
It is an amenable number.
1021299868961 is a deficient number, since it is larger than the sum of its proper divisors (1).
1021299868961 is an equidigital number, since it uses as much as digits as its factorization.
1021299868961 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6718464, while the sum is 62.
The spelling of 1021299868961 in words is "one trillion, twenty-one billion, two hundred ninety-nine million, eight hundred sixty-eight thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •