Base | Representation |
---|---|
bin | 10111001100100101101000… |
… | …100110001110011111111101 |
3 | 111101020000202002101022220211 |
4 | 113030211220212032133331 |
5 | 101332444142414030323 |
6 | 1000551220511512421 |
7 | 30326465335461154 |
oct | 2714455046163775 |
9 | 441200662338824 |
10 | 102020113033213 |
11 | 2a56353a16a561 |
12 | b538221528711 |
13 | 44c05bc60caab |
14 | 1b29b2a9ac59b |
15 | bbdb9d3e470d |
hex | 5cc96898e7fd |
102020113033213 has 48 divisors (see below), whose sum is σ = 111764860787520. Its totient is φ = 92791931871744.
The previous prime is 102020113033127. The next prime is 102020113033243. The reversal of 102020113033213 is 312330311020201.
It is not a de Polignac number, because 102020113033213 - 245 = 66835740944381 is a prime.
It is a super-2 number, since 2×1020201130332132 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102020113033243) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4093399770 + ... + 4093424692.
It is an arithmetic number, because the mean of its divisors is an integer number (2328434599740).
Almost surely, 2102020113033213 is an apocalyptic number.
It is an amenable number.
102020113033213 is a deficient number, since it is larger than the sum of its proper divisors (9744747754307).
102020113033213 is a wasteful number, since it uses less digits than its factorization.
102020113033213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25546 (or 25319 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 102020113033213 its reverse (312330311020201), we get a palindrome (414350424053414).
The spelling of 102020113033213 in words is "one hundred two trillion, twenty billion, one hundred thirteen million, thirty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •