Base | Representation |
---|---|
bin | 10111001100011100011010… |
… | …011001110100001010111010 |
3 | 111101012002012000101012202200 |
4 | 113030130122121310022322 |
5 | 101332313403033102302 |
6 | 1000542502153411030 |
7 | 30325665062456403 |
oct | 2714343231641272 |
9 | 441162160335680 |
10 | 102010211222202 |
11 | 2a55a31891a378 |
12 | b536319409a76 |
13 | 44bc6a2080a1a |
14 | 1b2946b8c89aa |
15 | bbd7bde7e81c |
hex | 5cc71a6742ba |
102010211222202 has 24 divisors (see below), whose sum is σ = 221104197247284. Its totient is φ = 33990777135744.
The previous prime is 102010211222197. The next prime is 102010211222281. The reversal of 102010211222202 is 202222112010201.
It is a happy number.
102010211222202 is a `hidden beast` number, since 1 + 0 + 20 + 10 + 211 + 222 + 202 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 99255570618681 + 2754640603521 = 9962709^2 + 1659711^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1052167263 + ... + 1052264210.
Almost surely, 2102010211222202 is an apocalyptic number.
102010211222202 is an abundant number, since it is smaller than the sum of its proper divisors (119093986025082).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102010211222202 is a wasteful number, since it uses less digits than its factorization.
102010211222202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2104434174 (or 2104434171 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 102010211222202 its reverse (202222112010201), we get a palindrome (304232323232403).
The spelling of 102010211222202 in words is "one hundred two trillion, ten billion, two hundred eleven million, two hundred twenty-two thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •