Base | Representation |
---|---|
bin | 10111001101000100101010… |
… | …100001010111111101010101 |
3 | 111101100012202002121021100011 |
4 | 113031010222201113331111 |
5 | 101334020411403442323 |
6 | 1001014411002120221 |
7 | 30332055110252623 |
oct | 2715045241277525 |
9 | 441305662537304 |
10 | 102053431312213 |
11 | 2a5766874a2727 |
12 | b54277b7b0071 |
13 | 44c379c2b7194 |
14 | 1b2b5ab9d0513 |
15 | bbe99d4d220d |
hex | 5cd12a857f55 |
102053431312213 has 8 divisors (see below), whose sum is σ = 103592966345856. Its totient is φ = 100516734133200.
The previous prime is 102053431312207. The next prime is 102053431312229. The reversal of 102053431312213 is 312213134350201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102053431312213 - 25 = 102053431312181 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102053431312013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 709391193 + ... + 709535038.
It is an arithmetic number, because the mean of its divisors is an integer number (12949120793232).
Almost surely, 2102053431312213 is an apocalyptic number.
It is an amenable number.
102053431312213 is a deficient number, since it is larger than the sum of its proper divisors (1539535033643).
102053431312213 is a wasteful number, since it uses less digits than its factorization.
102053431312213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1418927315.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 102053431312213 its reverse (312213134350201), we get a palindrome (414266565662414).
The spelling of 102053431312213 in words is "one hundred two trillion, fifty-three billion, four hundred thirty-one million, three hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •