Base | Representation |
---|---|
bin | 10110111111001110110001… |
… | …010100110110000100000111 |
3 | 111020222021110212021201000222 |
4 | 112333032301110312010013 |
5 | 101222424311303241403 |
6 | 555005414132454555 |
7 | 30203252006310662 |
oct | 2677166124660407 |
9 | 436867425251028 |
10 | 101102210212103 |
11 | 2a23a22aa32241 |
12 | b40a35177a45b |
13 | 4454b88ab9b19 |
14 | 1ad7531a546d9 |
15 | ba4d79308338 |
hex | 5bf3b1536107 |
101102210212103 has 2 divisors, whose sum is σ = 101102210212104. Its totient is φ = 101102210212102.
The previous prime is 101102210212063. The next prime is 101102210212207. The reversal of 101102210212103 is 301212012201101.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101102210212103 - 236 = 101033490735367 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101102210217103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50551105106051 + 50551105106052.
It is an arithmetic number, because the mean of its divisors is an integer number (50551105106052).
Almost surely, 2101102210212103 is an apocalyptic number.
101102210212103 is a deficient number, since it is larger than the sum of its proper divisors (1).
101102210212103 is an equidigital number, since it uses as much as digits as its factorization.
101102210212103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 101102210212103 its reverse (301212012201101), we get a palindrome (402314222413204).
The spelling of 101102210212103 in words is "one hundred one trillion, one hundred two billion, two hundred ten million, two hundred twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •