Base | Representation |
---|---|
bin | 11101101011111100000… |
… | …11001011110001011101 |
3 | 10121111212002101001220212 |
4 | 32311332003023301131 |
5 | 113203001113404041 |
6 | 2100331443422205 |
7 | 133460045024564 |
oct | 16657603136135 |
9 | 3544762331825 |
10 | 1020022013021 |
11 | 36365291a6a0 |
12 | 14582b384965 |
13 | 752593acc1b |
14 | 3752561cbdb |
15 | 1b7ee3ce8eb |
hex | ed7e0cbc5d |
1020022013021 has 16 divisors (see below), whose sum is σ = 1115479729728. Its totient is φ = 925019654400.
The previous prime is 1020022012991. The next prime is 1020022013039. The reversal of 1020022013021 is 1203102200201.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1020022013021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1020022012987 and 1020022013005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020022012021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 52511891 + ... + 52531311.
It is an arithmetic number, because the mean of its divisors is an integer number (69717483108).
Almost surely, 21020022013021 is an apocalyptic number.
1020022013021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1020022013021 is a deficient number, since it is larger than the sum of its proper divisors (95457716707).
1020022013021 is a wasteful number, since it uses less digits than its factorization.
1020022013021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30892.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 1020022013021 its reverse (1203102200201), we get a palindrome (2223124213222).
The spelling of 1020022013021 in words is "one trillion, twenty billion, twenty-two million, thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •