Base | Representation |
---|---|
bin | 10111001100011111010011… |
… | …010011010101111000000011 |
3 | 111101012101012012111121112011 |
4 | 113030133103103111320003 |
5 | 101332341231201411321 |
6 | 1000544134050113351 |
7 | 30326135001001642 |
oct | 2714372323257003 |
9 | 441171165447464 |
10 | 102013313310211 |
11 | 2a56066a977a76 |
12 | b536a4427b857 |
13 | 44bca7795a264 |
14 | 1b296838a7359 |
15 | bbd90148bae1 |
hex | 5cc7d34d5e03 |
102013313310211 has 4 divisors (see below), whose sum is σ = 107382435063400. Its totient is φ = 96644191557024.
The previous prime is 102013313310121. The next prime is 102013313310239. The reversal of 102013313310211 is 112013313310201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102013313310211 - 227 = 102013179092483 is a prime.
It is a super-3 number, since 3×1020133133102113 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (102013313313211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2684560876566 + ... + 2684560876603.
It is an arithmetic number, because the mean of its divisors is an integer number (26845608765850).
Almost surely, 2102013313310211 is an apocalyptic number.
102013313310211 is a deficient number, since it is larger than the sum of its proper divisors (5369121753189).
102013313310211 is an equidigital number, since it uses as much as digits as its factorization.
102013313310211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5369121753188.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 102013313310211 its reverse (112013313310201), we get a palindrome (214026626620412).
The spelling of 102013313310211 in words is "one hundred two trillion, thirteen billion, three hundred thirteen million, three hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.336 sec. • engine limits •