Base | Representation |
---|---|
bin | 11101101101110010000… |
… | …00101011011110101011 |
3 | 10121121102000201121002121 |
4 | 32312321000223132223 |
5 | 113212012332242303 |
6 | 2101013541412111 |
7 | 133523416052323 |
oct | 16667100533653 |
9 | 3547360647077 |
10 | 1021011212203 |
11 | 364010236684 |
12 | 145a6670a037 |
13 | 75386307b98 |
14 | 375bab58283 |
15 | 1b85b17a9bd |
hex | edb902b7ab |
1021011212203 has 8 divisors (see below), whose sum is σ = 1034373011760. Its totient is φ = 1007713192800.
The previous prime is 1021011212171. The next prime is 1021011212209. The reversal of 1021011212203 is 3022121101201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1021011212203 - 25 = 1021011212171 is a prime.
It is a super-2 number, since 2×10210112122032 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1021011212209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15912813 + ... + 15976846.
It is an arithmetic number, because the mean of its divisors is an integer number (129296626470).
Almost surely, 21021011212203 is an apocalyptic number.
1021011212203 is a deficient number, since it is larger than the sum of its proper divisors (13361799557).
1021011212203 is a wasteful number, since it uses less digits than its factorization.
1021011212203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31890077.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 1021011212203 its reverse (3022121101201), we get a palindrome (4043132313404).
The spelling of 1021011212203 in words is "one trillion, twenty-one billion, eleven million, two hundred twelve thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •