Base | Representation |
---|---|
bin | 100000010100110111101… |
… | …010101000000000000001 |
3 | 21212100220102020120222101 |
4 | 200110313222220000001 |
5 | 242343443043402201 |
6 | 4420302313310401 |
7 | 316331104362301 |
oct | 40246752500001 |
9 | 7770812216871 |
10 | 2221432012801 |
11 | 787116505461 |
12 | 2ba641105401 |
13 | 131631b37b11 |
14 | 797370dd601 |
15 | 3cbb7c87d01 |
hex | 20537aa8001 |
2221432012801 has 4 divisors (see below), whose sum is σ = 2221463336004. Its totient is φ = 2221400689600.
The previous prime is 2221432012759. The next prime is 2221432012837. The reversal of 2221432012801 is 1082102341222.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1504106016400 + 717325996401 = 1226420^2 + 846951^2 .
It is a cyclic number.
It is not a de Polignac number, because 2221432012801 - 223 = 2221423624193 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2221432012801.
It is not an unprimeable number, because it can be changed into a prime (2221432012871) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15554980 + ... + 15697141.
It is an arithmetic number, because the mean of its divisors is an integer number (555365834001).
Almost surely, 22221432012801 is an apocalyptic number.
It is an amenable number.
2221432012801 is a deficient number, since it is larger than the sum of its proper divisors (31323203).
2221432012801 is an equidigital number, since it uses as much as digits as its factorization.
2221432012801 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31323202.
The product of its (nonzero) digits is 3072, while the sum is 28.
The spelling of 2221432012801 in words is "two trillion, two hundred twenty-one billion, four hundred thirty-two million, twelve thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •