Base | Representation |
---|---|
bin | 11101101101111101110… |
… | …01111100111100010101 |
3 | 10121121122220211020010211 |
4 | 32312332321330330111 |
5 | 113212213142041041 |
6 | 2101031433245421 |
7 | 133526026513066 |
oct | 16667671747425 |
9 | 3547586736124 |
10 | 1021110112021 |
11 | 36406104656a |
12 | 145a93863871 |
13 | 753a095499c |
14 | 375c9d4056d |
15 | 1b864bb4481 |
hex | edbee7cf15 |
1021110112021 has 8 divisors (see below), whose sum is σ = 1065521346624. Its totient is φ = 976700139360.
The previous prime is 1021110111991. The next prime is 1021110112079. The reversal of 1021110112021 is 1202110111201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1021110112021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1021110111992 and 1021110112010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021110115021) 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, 1580530 + ... + 2130796.
It is an arithmetic number, because the mean of its divisors is an integer number (133190168328).
Almost surely, 21021110112021 is an apocalyptic number.
It is an amenable number.
1021110112021 is a deficient number, since it is larger than the sum of its proper divisors (44411234603).
1021110112021 is an equidigital number, since it uses as much as digits as its factorization.
1021110112021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 630971.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1021110112021 its reverse (1202110111201), we get a palindrome (2223220223222).
The spelling of 1021110112021 in words is "one trillion, twenty-one billion, one hundred ten million, one hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.550 sec. • engine limits •