Base | Representation |
---|---|
bin | 11101101101110011010… |
… | …10001110001001011111 |
3 | 10121121102210012212020112 |
4 | 32312321222032021133 |
5 | 113212023124231421 |
6 | 2101015011040235 |
7 | 133523610446324 |
oct | 16667152161137 |
9 | 3547383185215 |
10 | 1021022102111 |
11 | 3640163a4400 |
12 | 145a6a2a007b |
13 | 7538864b80b |
14 | 375bc390b4b |
15 | 1b85c0cc45b |
hex | edb9a8e25f |
1021022102111 has 48 divisors (see below), whose sum is σ = 1157991206400. Its totient is φ = 899116500480.
The previous prime is 1021022102053. The next prime is 1021022102117. The reversal of 1021022102111 is 1112012201201.
It is not a de Polignac number, because 1021022102111 - 222 = 1021017907807 is a prime.
It is a super-2 number, since 2×10210221021112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021022102117) 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, 279042200 + ... + 279045858.
It is an arithmetic number, because the mean of its divisors is an integer number (24124816800).
Almost surely, 21021022102111 is an apocalyptic number.
1021022102111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1021022102111 is a deficient number, since it is larger than the sum of its proper divisors (136969104289).
1021022102111 is a wasteful number, since it uses less digits than its factorization.
1021022102111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4220 (or 4209 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1021022102111 its reverse (1112012201201), we get a palindrome (2133034303312).
The spelling of 1021022102111 in words is "one trillion, twenty-one billion, twenty-two million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •