Base | Representation |
---|---|
bin | 11101011101000001000… |
… | …11111110100000111101 |
3 | 10120202011210102112110210 |
4 | 32232200203332200331 |
5 | 113040044320201341 |
6 | 2052524514023033 |
7 | 133054402263642 |
oct | 16564043764075 |
9 | 3522153375423 |
10 | 1012011100221 |
11 | 360211979300 |
12 | 144174577a79 |
13 | 74580818934 |
14 | 36da5713dc9 |
15 | 1b4d0e7ac16 |
hex | eba08fe83d |
1012011100221 has 24 divisors (see below), whose sum is σ = 1484329910112. Its totient is φ = 612859482400.
The previous prime is 1012011100201. The next prime is 1012011100231. The reversal of 1012011100221 is 1220011102101.
It is not a de Polignac number, because 1012011100221 - 217 = 1012010969149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1012011100197 and 1012011100206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012011100201) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 628035 + ... + 1555136.
It is an arithmetic number, because the mean of its divisors is an integer number (61847079588).
Almost surely, 21012011100221 is an apocalyptic number.
1012011100221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1012011100221 is a deficient number, since it is larger than the sum of its proper divisors (472318809891).
1012011100221 is a wasteful number, since it uses less digits than its factorization.
1012011100221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2184473 (or 2184462 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1012011100221 its reverse (1220011102101), we get a palindrome (2232022202322).
The spelling of 1012011100221 in words is "one trillion, twelve billion, eleven million, one hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •