Base | Representation |
---|---|
bin | 10001101000110010000… |
… | …101010001100110101101 |
3 | 11021212102211101020212012 |
4 | 101220302011101212231 |
5 | 124324204340133401 |
6 | 2324443400451005 |
7 | 153365003460542 |
oct | 21506205214655 |
9 | 4255384336765 |
10 | 1212021021101 |
11 | 4280192a6180 |
12 | 176a93479a65 |
13 | 8a3a6bcc647 |
14 | 4293ac58bc9 |
15 | 217da20e8bb |
hex | 11a321519ad |
1212021021101 has 8 divisors (see below), whose sum is σ = 1325656986624. Its totient is φ = 1098960428320.
The previous prime is 1212021021091. The next prime is 1212021021143. The reversal of 1212021021101 is 1011201202121.
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 1212021021101 - 230 = 1210947279277 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1212021021191) 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, 143838776 + ... + 143847201.
It is an arithmetic number, because the mean of its divisors is an integer number (165707123328).
Almost surely, 21212021021101 is an apocalyptic number.
1212021021101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1212021021101 is a deficient number, since it is larger than the sum of its proper divisors (113635965523).
1212021021101 is a wasteful number, since it uses less digits than its factorization.
1212021021101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 287686371.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1212021021101 its reverse (1011201202121), we get a palindrome (2223222223222).
The spelling of 1212021021101 in words is "one trillion, two hundred twelve billion, twenty-one million, twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •