Base | Representation |
---|---|
bin | 100000001100010001011… |
… | …110010011100001100001 |
3 | 21211111002010001112020212 |
4 | 200030101132103201201 |
5 | 242221042014030101 |
6 | 4412134331343505 |
7 | 315553260626201 |
oct | 40142136234141 |
9 | 7744063045225 |
10 | 2212201314401 |
11 | 783209a740a1 |
12 | 2b88a58b1b95 |
13 | 1307c06426c0 |
14 | 790dd1d4401 |
15 | 3c8276db1bb |
hex | 20311793861 |
2212201314401 has 8 divisors (see below), whose sum is σ = 2385974847144. Its totient is φ = 2038942667520.
The previous prime is 2212201314383. The next prime is 2212201314403. The reversal of 2212201314401 is 1044131022122.
It can be written as a sum of positive squares in 4 ways, for example, as 291726400 + 2211909588001 = 17080^2 + 1487249^2 .
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 2212201314401 - 222 = 2212197120097 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2212201314403) 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, 128712536 + ... + 128729721.
It is an arithmetic number, because the mean of its divisors is an integer number (298246855893).
Almost surely, 22212201314401 is an apocalyptic number.
It is an amenable number.
2212201314401 is a deficient number, since it is larger than the sum of its proper divisors (173773532743).
2212201314401 is a wasteful number, since it uses less digits than its factorization.
2212201314401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 257442931.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 2212201314401 its reverse (1044131022122), we get a palindrome (3256332336523).
The spelling of 2212201314401 in words is "two trillion, two hundred twelve billion, two hundred one million, three hundred fourteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •