Base | Representation |
---|---|
bin | 101111110001101001110001… |
… | …111001110011001000100001 |
3 | 1000112222022020001110221010102 |
4 | 233301221301321303020201 |
5 | 210020102334031010334 |
6 | 2022515533403112145 |
7 | 62154455636612546 |
oct | 5761516171631041 |
9 | 1015868201427112 |
10 | 210120301031969 |
11 | 60a50579120239 |
12 | 1b69687b812655 |
13 | 903234aaa1193 |
14 | 39c5c3c05abcd |
15 | 1945aa05ec67e |
hex | bf1a71e73221 |
210120301031969 has 2 divisors, whose sum is σ = 210120301031970. Its totient is φ = 210120301031968.
The previous prime is 210120301031959. The next prime is 210120301031983. The reversal of 210120301031969 is 969130103021012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 202263492031969 + 7856809000000 = 14221937^2 + 2803000^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210120301031969 is a prime.
It is a super-2 number, since 2×2101203010319692 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (210120301031909) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105060150515984 + 105060150515985.
It is an arithmetic number, because the mean of its divisors is an integer number (105060150515985).
Almost surely, 2210120301031969 is an apocalyptic number.
It is an amenable number.
210120301031969 is a deficient number, since it is larger than the sum of its proper divisors (1).
210120301031969 is an equidigital number, since it uses as much as digits as its factorization.
210120301031969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17496, while the sum is 38.
The spelling of 210120301031969 in words is "two hundred ten trillion, one hundred twenty billion, three hundred one million, thirty-one thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •