Base | Representation |
---|---|
bin | 10000000010010100111… |
… | …011010101101100000001 |
3 | 10220100110222122001220201 |
4 | 100002110323111230001 |
5 | 121023404103223243 |
6 | 2202131223205201 |
7 | 142421561145142 |
oct | 20022473255401 |
9 | 3810428561821 |
10 | 1102010211073 |
11 | 3953a6042362 |
12 | 1596b0ba6801 |
13 | 7cbc43b9295 |
14 | 3b4a245dac9 |
15 | 1d9ec1ce04d |
hex | 10094ed5b01 |
1102010211073 has 2 divisors, whose sum is σ = 1102010211074. Its totient is φ = 1102010211072.
The previous prime is 1102010211059. The next prime is 1102010211163. The reversal of 1102010211073 is 3701120102011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 879331926529 + 222678284544 = 937727^2 + 471888^2 .
It is a cyclic number.
It is not a de Polignac number, because 1102010211073 - 25 = 1102010211041 is a prime.
It is a super-2 number, since 2×11020102110732 (a number of 25 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 1102010211073.
It is not a weakly prime, because it can be changed into another prime (1102010215073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551005105536 + 551005105537.
It is an arithmetic number, because the mean of its divisors is an integer number (551005105537).
Almost surely, 21102010211073 is an apocalyptic number.
It is an amenable number.
1102010211073 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102010211073 is an equidigital number, since it uses as much as digits as its factorization.
1102010211073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 84, while the sum is 19.
Adding to 1102010211073 its reverse (3701120102011), we get a palindrome (4803130313084).
The spelling of 1102010211073 in words is "one trillion, one hundred two billion, ten million, two hundred eleven thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •