Base | Representation |
---|---|
bin | 10111001101110000111101… |
… | …110101111010000101000011 |
3 | 111101111202112020200011211010 |
4 | 113031300331311322011003 |
5 | 101340310322011232321 |
6 | 1001052315114252003 |
7 | 30335360651303565 |
oct | 2715607565720503 |
9 | 441452466604733 |
10 | 102101000102211 |
11 | 2a594877876710 |
12 | b54ba36427003 |
13 | 44c81104615b6 |
14 | 1b2da01499335 |
15 | bc0d346d8676 |
hex | 5cdc3dd7a143 |
102101000102211 has 64 divisors (see below), whose sum is σ = 158892379163136. Its totient is φ = 57630476544000.
The previous prime is 102101000102209. The next prime is 102101000102219. The reversal of 102101000102211 is 112201000101201.
It is not a de Polignac number, because 102101000102211 - 21 = 102101000102209 is a prime.
It is a super-2 number, since 2×1021010001022112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102101000102219) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 100749021 + ... + 101757393.
It is an arithmetic number, because the mean of its divisors is an integer number (2482693424424).
Almost surely, 2102101000102211 is an apocalyptic number.
102101000102211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
102101000102211 is a deficient number, since it is larger than the sum of its proper divisors (56791379060925).
102101000102211 is a wasteful number, since it uses less digits than its factorization.
102101000102211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1010292.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 102101000102211 its reverse (112201000101201), we get a palindrome (214302000203412).
The spelling of 102101000102211 in words is "one hundred two trillion, one hundred one billion, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •