Base | Representation |
---|---|
bin | 10111001100011100001111… |
… | …000100111110110001001001 |
3 | 111101012001200202211122200111 |
4 | 113030130033010332301021 |
5 | 101332313010412224314 |
6 | 1000542431245034321 |
7 | 30325660264424446 |
oct | 2714341704766111 |
9 | 441161622748614 |
10 | 102010021211209 |
11 | 2a55a23063a2a1 |
12 | b5362858559a1 |
13 | 44bc6718b3297 |
14 | 1b294505869cd |
15 | bbd7ac449ec4 |
hex | 5cc70f13ec49 |
102010021211209 has 2 divisors, whose sum is σ = 102010021211210. Its totient is φ = 102010021211208.
The previous prime is 102010021211177. The next prime is 102010021211249. The reversal of 102010021211209 is 902112120010201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100645598643984 + 1364422567225 = 10032228^2 + 1168085^2 .
It is a cyclic number.
It is not a de Polignac number, because 102010021211209 - 25 = 102010021211177 is a prime.
It is a super-2 number, since 2×1020100212112092 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 102010021211209.
It is not a weakly prime, because it can be changed into another prime (102010021211249) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51005010605604 + 51005010605605.
It is an arithmetic number, because the mean of its divisors is an integer number (51005010605605).
Almost surely, 2102010021211209 is an apocalyptic number.
It is an amenable number.
102010021211209 is a deficient number, since it is larger than the sum of its proper divisors (1).
102010021211209 is an equidigital number, since it uses as much as digits as its factorization.
102010021211209 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 102010021211209 in words is "one hundred two trillion, ten billion, twenty-one million, two hundred eleven thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •