Base | Representation |
---|---|
bin | 11101011011100010111… |
… | …10000001011000110001 |
3 | 10120200010201201210101212 |
4 | 32231301132001120301 |
5 | 113031440034304334 |
6 | 2052314251405505 |
7 | 133025666522552 |
oct | 16556136013061 |
9 | 3520121653355 |
10 | 1011221009969 |
11 | 35a946996855 |
12 | 143b93a53895 |
13 | 74485c25501 |
14 | 36d2c808329 |
15 | 1b48690eece |
hex | eb71781631 |
1011221009969 has 2 divisors, whose sum is σ = 1011221009970. Its totient is φ = 1011221009968.
The previous prime is 1011221009959. The next prime is 1011221010049. The reversal of 1011221009969 is 9699001221101.
It is a happy number.
1011221009969 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., 756865200400 + 254355809569 = 869980^2 + 504337^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1011221009969 is a prime.
It is a super-2 number, since 2×10112210099692 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1011221009959) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505610504984 + 505610504985.
It is an arithmetic number, because the mean of its divisors is an integer number (505610504985).
Almost surely, 21011221009969 is an apocalyptic number.
It is an amenable number.
1011221009969 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011221009969 is an equidigital number, since it uses as much as digits as its factorization.
1011221009969 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 17496, while the sum is 41.
The spelling of 1011221009969 in words is "one trillion, eleven billion, two hundred twenty-one million, nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •