Base | Representation |
---|---|
bin | 10111001100100101111100… |
… | …000111000100111111010001 |
3 | 111101020001120220101220100021 |
4 | 113030211330013010333101 |
5 | 101333000330221141423 |
6 | 1000551313204423441 |
7 | 30326506422241456 |
oct | 2714457407047721 |
9 | 441201526356307 |
10 | 102020440412113 |
11 | 2a563697a44133 |
12 | b5382b30a7b81 |
13 | 44c06423a5812 |
14 | 1b29b5c26b82d |
15 | bbdbbc01095d |
hex | 5cc97c1c4fd1 |
102020440412113 has 4 divisors (see below), whose sum is σ = 102028018264128. Its totient is φ = 102012862560100.
The previous prime is 102020440411993. The next prime is 102020440412183. The reversal of 102020440412113 is 311214044020201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102020440412113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102020440412183) 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, 3788905813 + ... + 3788932738.
It is an arithmetic number, because the mean of its divisors is an integer number (25507004566032).
Almost surely, 2102020440412113 is an apocalyptic number.
It is an amenable number.
102020440412113 is a deficient number, since it is larger than the sum of its proper divisors (7577852015).
102020440412113 is an equidigital number, since it uses as much as digits as its factorization.
102020440412113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7577852014.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 102020440412113 its reverse (311214044020201), we get a palindrome (413234484432314).
The spelling of 102020440412113 in words is "one hundred two trillion, twenty billion, four hundred forty million, four hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.049 sec. • engine limits •