Base | Representation |
---|---|
bin | 1001001001000010111011… |
… | …10100100101101010010001 |
3 | 2122011201211101222220022221 |
4 | 10210201131310211222101 |
5 | 10113322414334341423 |
6 | 110430424014301041 |
7 | 4143215551224655 |
oct | 444413564455221 |
9 | 78151741886287 |
10 | 20102021012113 |
11 | 6450245891487 |
12 | 2307aa61b7781 |
13 | b2a7c6716821 |
14 | 4d6d2b886a65 |
15 | 24cd76733e5d |
hex | 12485dd25a91 |
20102021012113 has 4 divisors (see below), whose sum is σ = 20102083248420. Its totient is φ = 20101958775808.
The previous prime is 20102021012107. The next prime is 20102021012147. The reversal of 20102021012113 is 31121012020102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 15401480478784 + 4700540533329 = 3924472^2 + 2168073^2 .
It is a cyclic number.
It is not a de Polignac number, because 20102021012113 - 213 = 20102021003921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20102021012153) 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, 30631120 + ... + 31280497.
It is an arithmetic number, because the mean of its divisors is an integer number (5025520812105).
Almost surely, 220102021012113 is an apocalyptic number.
It is an amenable number.
20102021012113 is a deficient number, since it is larger than the sum of its proper divisors (62236307).
20102021012113 is an equidigital number, since it uses as much as digits as its factorization.
20102021012113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62236306.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 20102021012113 its reverse (31121012020102), we get a palindrome (51223033032215).
The spelling of 20102021012113 in words is "twenty trillion, one hundred two billion, twenty-one million, twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •